Predicate-functors and the limits of decidability in logic
DOI10.1305/NDJFL/1093883255zbMATH Open0416.03014OpenAlexW2043553949MaRDI QIDQ754174FDOQ754174
Publication date: 1980
Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1305/ndjfl/1093883255
decidabilitypermutations or recurrences of predicate placespolyadic logicpredicate-functor logicquantificational schemata
Other nonclassical logic (03B60) Decidability of theories and sets of sentences (03B25) Cylindric and polyadic algebras; relation algebras (03G15) Algebraic logic (03G99)
Cited In (10)
- Decidability of fluted logic with identity
- Fred Sommers’ Contributions to Formal Logic
- The completeness of a predicate-functor logic
- THE FLUTED FRAGMENT REVISITED
- The fluted fragment with transitive relations
- Murphree's numerical term logic tableaux
- Syllogistic relevance and term logic
- Fluted formulas and the limits of decidability
- The Fluted Fragment with Transitivity
- Quine's ‘limits of decision’
This page was built for publication: Predicate-functors and the limits of decidability in logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q754174)
