The following pages link to Osamu Sonobe (Q588143):
Displayed 50 items.
- On the deductive system of the order of an equationally orderable quasivariety (Q295923) (← links)
- Positive provability logic for uniform reflection principles (Q392274) (← links)
- Leibniz interpolation properties (Q393904) (← links)
- Algebraic proof theory for substructural logics: cut-elimination and completions (Q409322) (← links)
- Counter-example construction with Euler diagrams (Q495828) (← links)
- An algebraic approach to subframe logics. Modal case (Q540406) (← links)
- A sequent calculus for a negative free logic (Q622624) (← links)
- On the proof-theory of two formalisations of modal first-order logic (Q622627) (← links)
- Cut elimination and strong separation for substructural logics: an algebraic approach (Q636346) (← links)
- MacNeille completions of FL-algebras (Q652517) (← links)
- Item:Q588143 (redirect page) (← links)
- Maximal Kripke-type semantics for modal and superintuitionistic predicate logics (Q688796) (← links)
- Proof-theoretical analysis of order relations (Q701722) (← links)
- The logic of proofs, semantically (Q703832) (← links)
- The \(\Sigma_1\)-provability logic of \(\mathsf{HA}\) (Q720757) (← links)
- A new theory of quantifiers and term connectives (Q735412) (← links)
- Uniform Lyndon interpolation property in propositional modal logics (Q781510) (← links)
- Commutativity and self-reference (Q786803) (← links)
- Polynomially bounded recursive realizability (Q817959) (← links)
- Restricted arrow (Q839646) (← links)
- Connectives stranger than tonk (Q853814) (← links)
- Modal logic for other-world agnostics: Neutrality and Halldén incompleteness (Q861518) (← links)
- Derivability in certain subsystems of the logic of proofs is \(\Pi_2^p\)-complete (Q866565) (← links)
- A simplification of the completeness proofs for Guaspari and Solovay's R (Q923070) (← links)
- A new proof of the fixed-point theorem of provability logic (Q923072) (← links)
- Gentzenizing Schroeder-Heister's natural extension of natural deduction (Q923083) (← links)
- Constructive logic with strong negation is a substructural logic. I (Q931408) (← links)
- An intuitionistic characterization of classical logic (Q939055) (← links)
- Quantifier elimination for a class of intuitionistic theories (Q948760) (← links)
- Associative substitutional semantics and quantified modal logic (Q965898) (← links)
- Proof-theoretic semantics for subsentential phrases (Q969428) (← links)
- Combining linear-time temporal logic with constructiveness and paraconsistency (Q975875) (← links)
- Kripke incomplete logics containing KTB (Q995674) (← links)
- Constructive logic with strong negation is a substructural logic. II (Q1005940) (← links)
- Frame based formulas for intermediate logics (Q1005954) (← links)
- Syntactic cut-elimination for common knowledge (Q1024553) (← links)
- Around provability logic (Q1035652) (← links)
- Absence of the interpolation property in the consistent normal modal extensions of the Dummett logic (Q1077401) (← links)
- Semantic trees for Dummett's logic LC (Q1092036) (← links)
- A cut-free Gentzen-type system for the logic of the weak law of excluded middle (Q1100191) (← links)
- Intensions, Church's Thesis, and the formalization of mathematics (Q1109758) (← links)
- Expressive completeness failure in branching time structures (Q1109759) (← links)
- Ordered sets R and Q as bases of Kripke models (Q1109762) (← links)
- Explicit fixed points in interpretability logic (Q1176094) (← links)
- On the proof of Solovay's theorem (Q1176096) (← links)
- Rosser orderings and free variables (Q1176097) (← links)
- The formalization of interpretability (Q1176098) (← links)
- Ancestral Kripke models and nonhereditary Kripke models for the Heyting propositional calculus (Q1182695) (← links)
- Rosser and Mostowski sentences (Q1263586) (← links)
- Epistemic set theory (Q1263587) (← links)