✦ LIBER ✦

On the decision problem for theories of finite models

✍ Scribed by Verena Huber Dyson

Book ID: 112884978
Publisher: The Hebrew University Magnes Press
Year: 1964
Tongue: English
Weight: 797 KB
Volume: 2
Category: Article
ISSN: 0021-2172
DOI: 10.1007/bf02759735

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On decidability of the decomposability p

On decidability of the decomposability problem for finite theories

✍ Andrey S. Morozov; Denis K. Ponomaryov 📂 Article 📅 2010 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 181 KB

The decision problem for some finite ext

The decision problem for some finite extensions of the intuitionistic theory of abelian groups

✍ Dov M. Gabbay 📂 Article 📅 1975 🏛 Springer Netherlands 🌐 English ⚖ 388 KB

Modeling unstructured decision problems

Modeling unstructured decision problems — the theory of analytical hierarchies

✍ Thomas L. Saaty 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 950 KB

The decision problem for some logics for

The decision problem for some logics for finite words on infinite alphabets

✍ Ch. Choffrut; S. Grigorieff 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 255 KB

Intractability of decision problems for

Intractability of decision problems for finite-memory automata

✍ Hiroshi Sakamoto; Daisuke Ikeda 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 145 KB

This paper deals with ÿnite-memory automata, introduced in Kaminski and Francez (Theoret. Comput. Sci. 134 (1994) 329-363). With a restricted memory structure that consists of a ÿnite number of registers, a ÿnite-memory automaton can store arbitrary input symbols. Thus, the language accepted by a ÿn

On complete theories with a finite numbe

On complete theories with a finite number of denumerable models

✍ M. G. Peretyat'kin 📂 Article 📅 1973 🏛 Springer US 🌐 English ⚖ 961 KB