Generalized quantifiers and well orderings

DOI10.1007/BF02019776MaRDI QIDQ5659525zbMATH OpenFDO

Authors 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

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

Cites work

• scientific article; zbMATH DE number 3286895 (Why is no real title available?)
• An application of games to the completeness problem for formalized theories
• Decidability of Second-Order Theories and Automata on Infinite Trees
• Grundzüge des Systemenkalküls II
• Logic with the quantifier “there exist uncountably many”
• Model-completeness in a first order language with a generalized quantifier
• On a generalization of quantifiers
• The completeness of logic with the added quantifier "there are uncountable many"

Cited in

(8)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5659525)