Generalized quantifiers and well orderings
From MaRDI portal
Publication:5659525
DOI10.1007/BF02019776zbMATH Open0247.02045MaRDI QIDQ5659525FDOQ5659525
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
Logic with extra quantifiers and operators (03C80) Decidability of theories and sets of sentences (03B25) Model theory (03C99)
Cites Work
- Decidability of Second-Order Theories and Automata on Infinite Trees
- On a generalization of quantifiers
- An application of games to the completeness problem for formalized theories
- Title not available (Why is that?)
- Model-completeness in a first order language with a generalized quantifier
- Grundzüge des Systemenkalküls II
- Logic with the quantifier “there exist uncountably many”
- The completeness of logic with the added quantifier "there are uncountable many"
Cited In (8)
- On quantifier-rank equivalence between linear orders
- The expressive power of Malitz quantifiers for linear orderings
- Muller message-passing automata and logics
- A generalization of Ehrenfeucht's game and some applications
- The theorems of beth and Craig in abstract model theory II. Compact logics
- On the elementary theory of inductive order
- Adjunction of a strong unit to a hyper-Archimedean lattice-ordered group
- Recursive categoricity and recursive stability
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)
