On compactness of logics that can express properties of symmetry or connectivity
From MaRDI portal
Publication:2350211
DOI10.1007/s11225-013-9522-3zbMath1370.03057arXiv1304.3606OpenAlexW2040975193MaRDI QIDQ2350211
Publication date: 18 June 2015
Published in: Studia Logica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1304.3606
automorphismcompletenesscompactnessconnectivityabstract logicrandom graph theorymodel theoretic logic
Automorphism groups of groups (20F28) Models with special properties (saturated, rigid, etc.) (03C50) Basic properties of first-order languages and structures (03C07) Abstract model theory (03C95)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Automorphisms of random graphs with specified vertices
- The asymptotic distribution of short cycles in random regular graphs
- The asymptotic connectivity of labelled regular graphs
- A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
- The asymptotic number of labeled graphs with given degree sequences
- A correction to “stationary logic”
- Generalized Quantifiers and Compact Logic
- Stationary logic
- Barwise: Abstract Model Theory and Generalized Quantifiers
- Model Theory
- Random graphs with bounded maximum degree: asymptotic structure and a logical limit law
- The completeness of logic with the added quantifier "there are uncountable many"
- On Extensions of Elementary Logic
- Logic with the quantifier “there exist uncountably many”
This page was built for publication: On compactness of logics that can express properties of symmetry or connectivity