Completeness and decidability of general first-order logic (with a detour through the guarded fragment)
From MaRDI portal
(Redirected from Publication:2363413)
Recommendations
Cites work
- Completeness in the theory of types
- scientific article; zbMATH DE number 3274715 (Why is no real title available?)
- Modal languages and bounded fragments of predicate logic
- On a generalization of quantifiers
- On a new semantics for first-order predicate logic
- On the general interpretation of first-order quantifiers
Cited in
(9)- Completeness issues in RUE-NRF deduction: The undecidability of viability
- On a decidable generalized quantifier logic corresponding to a decidable fragment of first-order logic
- On a new semantics for first-order predicate logic
- Combinations of Theories for Decidable Fragments of First-Order Logic
- scientific article; zbMATH DE number 1507188 (Why is no real title available?)
- scientific article; zbMATH DE number 2109542 (Why is no real title available?)
- A PSPACE-complete first-order fragment of computability logic
- Carnap's problem, definability and compositionality
- Most general first order theorems are not recursively enumerable
This page was built for publication: Completeness and decidability of general first-order logic (with a detour through the guarded fragment)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2363413)