Pages that link to "Item:Q2547549"
From MaRDI portal
The following pages link to Model theory for infinitary logic. Logic with countable conjunctions and finite quantifiers (Q2547549):
Displaying 50 items.
- Espaces de Baire et espaces de probabilité de structures rélationnelles (Q1230777) (← links)
- Elementary extensions of Levy's model of \(A^-_2\) (Q1232407) (← links)
- Finiteness is mu-ineffable (Q1236111) (← links)
- Uncountable universal locally finite groups (Q1240310) (← links)
- Consistency property and model existence theorem for second order negative languages with conjunctions and quantifications over sets of cardinality smaller than a strong limit cardinal of denumerable cofinality (Q1241504) (← links)
- Model theory via set theory (Q1244220) (← links)
- Robinson forcing is not absolute (Q1245825) (← links)
- Properties, propositions and sets (Q1249163) (← links)
- New axiomatizations for logics with generalized quantifiers (Q1256443) (← links)
- The Hanf number for classes of algebras whose largest congruence is always finitely generated (Q1259582) (← links)
- Borel equivalence relations induced by actions of the symmetric group (Q1295370) (← links)
- Proof methods for reasoning about possibility and necessity (Q1310399) (← links)
- Inseparability in recursive copies (Q1326768) (← links)
- A typed logic of partial functions reconstructed classically (Q1338893) (← links)
- Measuring the classification difficulty of countable torsion-free Abelian groups. (Q1414995) (← links)
- Ranks and pregeometries in finite diagrams (Q1591202) (← links)
- On institutions for modular coalgebraic specifications. (Q1603816) (← links)
- Arrovian aggregation of generalised expected-utility preferences: (im)possibility results by means of model theory (Q1615992) (← links)
- A formalized general theory of syntax with bindings (Q1687739) (← links)
- A strong failure of \(\aleph _0\)-stability for atomic classes (Q1712931) (← links)
- Scott sentences for certain groups (Q1745362) (← links)
- Hanf number for Scott sentences of computable structures (Q1756497) (← links)
- Models of set theory with definable ordinals (Q1777270) (← links)
- Orbit cardinals: On the effective cardinalities arising as quotient spaces of the form \(X/G\) where \(G\) acts on a Polish space \(X\) (Q1806265) (← links)
- Some applications of positive formulas in descriptive set theory and logic (Q1812904) (← links)
- Key notions of Tarski's methodology of deductive systems (Q1820770) (← links)
- Categoricity in hyperarithmetical degrees (Q1821772) (← links)
- Observational logic, constructor-based logic, and their duality. (Q1874280) (← links)
- A contextual-hierarchical approach to truth and the liar paradox (Q1876081) (← links)
- Generalized quantifiers and pebble games on finite structures (Q1892941) (← links)
- Logic of transition systems (Q1895974) (← links)
- Some applications of illfoundedness (Q1913295) (← links)
- The nonabsoluteness of model existence in uncountable cardinals for \(L_{\omega_{1},\omega}\) (Q1949163) (← links)
- Design of abstract domains using first-order logic (Q1960541) (← links)
- A formalized general theory of syntax with bindings: extended version (Q1984791) (← links)
- Martin's maximum\(^{++}\) implies Woodin's axiom \((*)\) (Q2028503) (← links)
- Possible predicates and actual properties (Q2053346) (← links)
- Infinite monochromatic paths and a theorem of Erdős-Hajnal-Rado (Q2181995) (← links)
- Model theoretic characterizations of large cardinals (Q2182021) (← links)
- Kurepa trees and spectra of \(\mathcal{L}_{\omega_1, \omega}\)-sentences (Q2204375) (← links)
- Lindström theorems in graded model theory (Q2220488) (← links)
- Encoding complete metric structures by classical structures (Q2228349) (← links)
- Empiricism, probability, and knowledge of arithmetic: a preliminary defense (Q2250551) (← links)
- On transferring model theoretic theorems of \(\mathcal L_{\infty,\omega}\) in the category of sets to a fixed Grothendieck topos (Q2254569) (← links)
- Notes on cardinals that are characterizable by a complete (Scott) sentence (Q2258542) (← links)
- More on looping vs. repeating in dynamic logic (Q2265813) (← links)
- Completeness theorems for \(\sigma \)-additive probabilistic semantics (Q2291370) (← links)
- Scott sentences for equivalence structures (Q2309506) (← links)
- Completeness theorem for probability models with finitely many valued measure (Q2330004) (← links)
- Computable categoricity for pseudo-exponential fields of \(\aleph_1\) (Q2349103) (← links)
