The following pages link to Model theory (Q1393228):
Displaying 50 items.
- An algebraic synthesis of the foundations of logic and probability (Q1096615) (← links)
- Effective topological spaces. III: Forcing and definability (Q1098842) (← links)
- Some applications of short core models (Q1099171) (← links)
- Countable ultraproducts without CH (Q1103612) (← links)
- A logical approach to asymptotic combinatorics I. First order properties (Q1103939) (← links)
- Stone duality for first order logic (Q1105598) (← links)
- Some relationships between logics of programs and complexity theory (Q1106839) (← links)
- Substructures and uniform elimination for p-adic fields (Q1109764) (← links)
- Some general incompleteness results for partial correctness logics (Q1110500) (← links)
- On Jónsson algebras over a commutative ring (Q1110574) (← links)
- Regularity of ultrafilters and the core model (Q1114680) (← links)
- The computational complexity of asymptotic problems. I: Partial orders (Q1115860) (← links)
- Infinite permutation groups. I: Products of conjugacy classes (Q1117026) (← links)
- A simplified proof of \(DDL<DL\) (Q1117214) (← links)
- Strong conceptual completeness for first-order logic (Q1118588) (← links)
- Eliminating the fixed predicates from a circumscription (Q1119564) (← links)
- Three-valued logics: An introduction, a comparison of various logical lexica, and some philosophical remarks (Q1123187) (← links)
- Completeness proofs for propositional logic with polynomial-time connectives (Q1123883) (← links)
- On the automorphism groups of homogeneous and saturated Boolean algebras (Q1134778) (← links)
- Minimal and prime models of complete theories of torsion free abelian groups (Q1137034) (← links)
- Monadic theory of order and topology. II (Q1137035) (← links)
- Rings of real-valued continuous functions. II (Q1138547) (← links)
- On the automorphism groups of countable Boolean algebras (Q1146205) (← links)
- On full embeddings. I (Q1147215) (← links)
- Automatic model construction (Q1149943) (← links)
- Stability of decision systems under majority rule (Q1151327) (← links)
- Axiomatic data type specifications: A first order theory of linear lists (Q1153682) (← links)
- Model completeness of some metric completions of absolutely free algebras (Q1155604) (← links)
- Non-isomorphic hyper-real fields from non-isomorphic ultrapowers (Q1158854) (← links)
- Floyd's principle, correctness theories and program equivalence (Q1158948) (← links)
- A complete logic for reasoning about programs via nonstandard model theory. I (Q1159460) (← links)
- A complete logic for reasoning about programs via nonstandard model theory. II (Q1159461) (← links)
- Solutions of algebraic differential equations (Q1159719) (← links)
- Infinite groups (Q1161607) (← links)
- Programs and program verifications in a general setting (Q1162355) (← links)
- A few remarks on Rowbottom cardinals (Q1170188) (← links)
- Definability by programs in first-order structures (Q1171876) (← links)
- On free constructions (Q1178745) (← links)
- Algebraic number fields elementarily determined by their absolute Galois group (Q1182655) (← links)
- Certain Boolean equations (Q1183343) (← links)
- Transitive primitive permutation groups acting on trees (Q1184184) (← links)
- Extensions of semigroup valued, finitely additive measures (Q1188331) (← links)
- On \(\kappa\)-complete reduced products (Q1190616) (← links)
- The age of a relational structure (Q1191913) (← links)
- Universal elements and the complexity of certain classes of infinite graphs (Q1191925) (← links)
- Distanced graphs (Q1193450) (← links)
- Abstract minimality and circumscription (Q1193477) (← links)
- A completeness result for allowed semi-strict programs with respect to well-behaved and allowed query clauses (Q1193863) (← links)
- What do numbers measure? A new approach to fundamental measurement (Q1196209) (← links)
- Inferring the equivalence of functional programs that mutate data (Q1196301) (← links)
