Finite model property
property of logical theories
In mathematical logic, a logic L has the finite model property (fmp for short) if any non-theorem of L is falsified by some finite model of L. Another way of putting this is to say that L has the fmp if for every formula A of L, A is an L-theorem if and only if A is a theorem of the theory of finite models of L.
If L is finitely axiomatizable (and has a recursive set of inference rules) and has the fmp, then it is decidable. However, the result does not hold if L is merely recursively axiomatizable. Even if there are only finitely many finite models to choose from (up to isomorphism) there is still the problem of checking whether the underlying frames of such models validate the logic, and this may not be decidable when the logic is not finitely axiomatizable, even when it is recursively axiomatizable. (Note that a logic is recursively enumerable if and only if it is recursively axiomatizable, a result known as Craig's theorem.)
Example
A first-order formula with one universal quantification has the fmp. A first-order formula without function symbols, where all existential quantifications appear first in the formula, also has the fmp.
See also
Kripke semantics
References
Patrick Blackburn, Maarten de Rijke, Yde Venema Modal Logic. Cambridge University Press, 2001.
Alasdair Urquhart. Decidability and the Finite Model Property. Journal of Philosophical Logic, 10 (1981), 367-370.
Begin with the source’s own compact description: “Finite model property” is property of logical theories. The dossier treats that line as a proposition to test through Finite, model and property, not as a finished interpretation.
Why this record matters
The phrase “property of logical theories” supplies a clear boundary for inquiry. It also exposes the unanswered questions: who defined that boundary, when it became stable and which sources sit outside it.
Vocabulary and entity names are the principal evidence signals here, because they determine the precision of every later search. The source revision retrieved here is dated Dec 9, 2025. The linked authority identifier is Q5450401. None of the 0 selected statements returned an explicit reference. The first chronological checks are 2001 and 1981.
Overview language is designed for orientation and should not be treated as a substitute for the evidence cited beneath it. The source lead contains qualifying language; that uncertainty should survive quotation, summary and reuse. Authority statements aid reconciliation but still require their own references, qualifiers and ranks to be checked.
How to read it
Use the entry as an orientation point, then follow its citations and revision history. Names, dates and institutional relationships should be checked against the original record.
- Subject orientation
- Search vocabulary
- Locating named sources
The closest primary source, responsible institution and strongest cited specialist reference.
Three-step research path
- Establish the record: confirm the title “Finite model property”, its source revision and the description used here.
- Expand the search: follow Finite model property primary sources, Finite model property archive and Finite research across catalogues and specialist indexes.
- Test the account: compare the strongest cited source with the responsible institution’s current record and note any disagreement.
Questions for further research
- Which source most directly establishes the central claim about “Finite model property”?
- Which cited source is closest to the event, object or claim?
- What terminology or title could unlock a more precise catalogue search?
Search terms from this dossier
This entry incorporates text from “Finite model property” on English Wikipedia. Contributors are listed in the page history. Text is available under the Creative Commons Attribution-ShareAlike 4.0 License. Selected authority identifiers and statements are retrieved from Wikidata under CC0; their references and qualifiers remain part of the verification path.