Pages that link to "Item:Q1378430"
From MaRDI portal
The following pages link to Not every ``tabular'' predicate logic is finitely axiomatizable (Q1378430):
Displaying 9 items.
- Finite axiomatizability of locally tabular superintuitionistic logics (Q581390) (← links)
- On the predicate logics of finite Kripke frames (Q1344873) (← links)
- On intermediate predicate logics of some finite Kripke frames. I: Levelwise uniform trees (Q1770592) (← links)
- (Q3509050) (← links)
- Tabular Logics with no Finite Bases for Inference Rules (Q4659578) (← links)
- On the Independent Axiomatizability of Modal and Intermediate Logics (Q4835534) (← links)
- (Q4896535) (← links)
- Finite-Variable Logics Do Not Have Weak Beth Definability Property (Q5350328) (← links)
- The superintuitionistic predicate logic of finite Kripke frames is not recursively axiomatizable (Q5718669) (← links)