Pages that link to "Item:Q2363413"

The following pages link to Completeness and decidability of general first-order logic (with a detour through the guarded fragment) (Q2363413):

Displaying 8 items.

• Most general first order theorems are not recursively enumerable (Q672461) (← links)
• Completeness issues in RUE-NRF deduction: The undecidability of viability (Q1311402) (← links)
• On a decidable generalized quantifier logic corresponding to a decidable fragment of first-order logic (Q1909605) (← links)
• On a new semantics for first-order predicate logic (Q2363414) (← links)
• Combinations of Theories for Decidable Fragments of First-Order Logic (Q3655205) (← links)
• (Q4503908) (← links)
• A PSPACE-complete first-order fragment of computability logic (Q5410328) (← links)
• Carnap's problem, definability and compositionality (Q6623816) (← links)