Generalized quantifiers and well orderings

DOI10.1007/BF02019776zbMath0247.02045MaRDI QIDQ5659525

A. B. Slomson

Publication date: 1972

Published in: Archiv für Mathematische Logik und Grundlagenforschung (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/137866

Mathematics Subject Classification ID

Model theory (03C99) Decidability of theories and sets of sentences (03B25) Logic with extra quantifiers and operators (03C80)

Related Items (8)

Recursive categoricity and recursive stability ⋮ The expressive power of Malitz quantifiers for linear orderings ⋮ Adjunction of a strong unit to a hyper-Archimedean lattice-ordered group ⋮ Muller message-passing automata and logics ⋮ On quantifier-rank equivalence between linear orders ⋮ On the elementary theory of inductive order ⋮ A generalization of Ehrenfeucht's game and some applications ⋮ The theorems of beth and Craig in abstract model theory II. Compact logics

Cites Work

• Unnamed Item
• Model-completeness in a first order language with a generalized quantifier
• On a generalization of quantifiers
• An application of games to the completeness problem for formalized theories
• The completeness of logic with the added quantifier "there are uncountable many"
• Logic with the quantifier “there exist uncountably many”
• Decidability of Second-Order Theories and Automata on Infinite Trees
• Grundzüge des Systemenkalküls II

This page was built for publication: Generalized quantifiers and well orderings