All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 2

Displaying 21 – 26 of 26

Showing per page

Theories of orders on the set of words

Dietrich Kuske (2006)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

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 the subword...

Theories of orders on the set of words

Dietrich Kuske (2010)

RAIRO - Theoretical Informatics and Applications

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 the ...

Three-quantifier sentences

Harvey M. Friedman (2003)

Fundamenta Mathematicae

We give a complete proof that all 3-quantifier sentences in the primitive notation of set theory (∈, =), are decided in ZFC, and in fact in a weak fragment of ZF without the power set axiom. We obtain information concerning witnesses of 2-quantifier formulas with one free variable. There is a 5-quantifier sentence that is not decided in ZFC (see [2]).

Currently displaying 21 – 26 of 26

Previous Page 2