Expressing cardinality quantifiers in monadic second-order logic over chains
DOI10.2178/JSL/1305810766zbMATH Open1222.03009OpenAlexW2154389574MaRDI QIDQ3011122FDOQ3011122
Vince Bárány, Łukasz Kaiser, Alexander Rabinovich
Publication date: 28 June 2011
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.169.9693
Recommendations
chainsordinalscardinality quantifierscountable linear ordersextension of monadic second-order logic of order
Logic with extra quantifiers and operators (03C80) Quantifier elimination, model completeness, and related topics (03C10)
Cites Work
- Weak Second‐Order Arithmetic and Finite Automata
- Modest theory of short chains. I
- The monadic second order theory of all countable ordinals
- The monadic theory of order
- First-order and counting theories ofω-automatic structures
- Monadic theory of order and topology, I
- The monadic theory of ω2
- Title not available (Why is that?)
- Modest theory of short chains. II
Cited In (9)
- Title not available (Why is that?)
- Cardinality Quantifiers in MLO over Trees
- Title not available (Why is that?)
- Title not available (Why is that?)
- Enhancing fixed point logic with cardinality quantifiers
- Interpreting second-order logic in the monadic theory of order
- Uncountable cardinals have the same monadic ∀11positive theory over large sets
- Cardinality logics. Part II: Definability in languages based on ‘exactly’
- Title not available (Why is that?)
This page was built for publication: Expressing cardinality quantifiers in monadic second-order logic over chains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3011122)
