Pages that link to "Item:Q2266003"
From MaRDI portal
The following pages link to Trees and finite satisfiability: proof of a conjecture of Burgess (Q2266003):
Displaying 10 items.
- Independent set readings and generalized quantifiers (Q848211) (← links)
- Wittgensteinian tableaux, identity, and co-denotation (Q1020577) (← links)
- More on trees and finite satisfiability: The taming of terms (Q1098832) (← links)
- Weak sequential theories of finite full binary trees (Q2104270) (← links)
- Finite tree property for first-order logic with identity and functions (Q2565989) (← links)
- A theorem on labelled trees and the limits of its provability (Q3199414) (← links)
- SUBFORMULA AND SEPARATION PROPERTIES IN NATURAL DEDUCTION VIA SMALL KRIPKE MODELS (Q3577741) (← links)
- Abduction via <i>C</i>-tableaux and δ-resolution (Q3647297) (← links)
- (Q4934251) (← links)
- (Q5186728) (← links)