States of affairs as values for formulas
Miroslav Mleziva (1975)
Kybernetika
Similarity:
Displaying similar documents to “Fin-set: a syntactical definition of finite sets.”
States of affairs as values for formulas
Characterizations of certain classes of posets having Gs-lattices of a relatively small size
Josef Dalík (1981)
Czechoslovak Mathematical Journal
Similarity:
Fixed points and self-reference.
Smullyan, Raymond M. (1984)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Hyperfinite and standard unifications for physical theories.
Herrmann, Robert A. (2001)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Comparison of the axioms of local and universal choice
Urlich Felgner (1971)
Fundamenta Mathematicae
Similarity:
Semantics based on states of affairs
Miroslav Mleziva (1975)
Kybernetika
Similarity:
Theories of orders on the set of words
Dietrich Kuske (2006)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
It is shown that small fragments of the first-order theory of the subword order, the (partial) lexicographic path ordering on words, the homomorphism preorder, and the infix order are undecidable. This is in contrast to the decidability of the monadic second-order theory of the prefix order [M.O. Rabin, Trans. Amer. Math. Soc., 1969] and of the theory of the total lexicographic path ordering [P. Narendran and M. Rusinowitch, Lect. Notes Artificial Intelligence, 2000] and, in case of...