On first-order sentences without finite models
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 3893165
- The Spectra of First-Order Sentences and Computational Complexity
- Zero-one laws for existential first-order sentences of bounded quantifier depth
- First-order definability on finite structures
- On distinguishing sets of structures by first-order sentences of minimal quantifier rank
- The decision problem for some classes of sentences without quantifiers
- Inductive inference in the limit for first-order sentences
- scientific article; zbMATH DE number 31602
- Undecidability of first order sentences in the theory of free groupoids
- First order logic without equality on relativized semantics
Cites work
- \(\aleph _ 0\)-categorical, \(\aleph _ 0\)-stable structures
- _0-categorical structures with a predimension
- Finite axiomatizability and theories with trivial algebraic closure
- scientific article; zbMATH DE number 638942 (Why is no real title available?)
- scientific article; zbMATH DE number 1425669 (Why is no real title available?)
- Randomness and semigenericity
Cited in
(4)- Deciding simple infinity axiom sets with one binary relation by means of superpostulates
- The finite submodel property and \(\omega\)-categorical expansions of pregeometries
- Finitely axiomatizable ω-categorical theories and the Mazoyer hypothesis
- Asymptotic probabilities of extension properties and random l-colourable structures
This page was built for publication: On first-order sentences without finite models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5311726)
