The following pages link to (Q3247123):
Displaying 19 items.
- Relational lattices: from databases to universal algebra (Q299191) (← links)
- Generating the variety of BL-algebras (Q816867) (← links)
- Finite approximability of forest superintuitionistic logics (Q1068076) (← links)
- Some kinds of modal completeness (Q1151886) (← links)
- The deducibilities of S5 (Q1159660) (← links)
- Finite axiomatization for some intermediate logics (Q1165839) (← links)
- On decision procedures for sentential logics (Q1181478) (← links)
- Mathematical modal logic: A view of its evolution (Q1422628) (← links)
- The finitely axiomatizable complete theories of non-associative arrow frames (Q1731561) (← links)
- First order logic without equality on relativized semantics (Q1791054) (← links)
- On the extension of intuitionistic propositional logic with Kreisel- Putnam's and Scott's schemes (Q1820767) (← links)
- Undecidability of the problem of recognizing axiomatizations of superintuitionistic propositional calculi (Q2259003) (← links)
- Generalizations of the weak law of the excluded middle (Q2354624) (← links)
- Basic hoops: an algebraic study of continuous t-norms (Q2462673) (← links)
- On the finite model property for Kripke models (Q2556329) (← links)
- Maksimova, Relevance and the Study of Lattices of Non-classical Logics (Q5214729) (← links)
- Concerning the Finite Model Property for Propositional Calculi (Q5551429) (← links)
- Some Ways of Constructing a Propositional Calculus of Any Required Degree of Unsolvability (Q5553280) (← links)
- Mechanising Gödel-Löb provability logic in HOL light (Q6050769) (← links)
