The following pages link to Mitsuhiro Okada (Q235600):
Displaying 19 items.
- Syntactic reduction in Husserl's early phenomenology of arithmetic (Q516253) (← links)
- A generalized syllogistic inference system based on inclusion and exclusion relations (Q692203) (← links)
- A rationale for conditional equational programming (Q915429) (← links)
- A weak intuitionistic propositional logic with purely constructive implication (Q1102265) (← links)
- Note on a proof of the extended Kirby-Paris theorem on labelled finite trees (Q1110524) (← links)
- A direct independence proof of Buchholz's Hydra Game on finite labeled trees (Q1128173) (← links)
- Abstract data type systems (Q1391729) (← links)
- Phase semantics for light linear logic (Q1398478) (← links)
- A graph-theoretic characterization theorem for multiplicative fragment of non-commutative linear logic (Q1398479) (← links)
- Phase semantic cut-elimination and normalization proofs of first- and higher-order linear logic (Q1575865) (← links)
- A uniform semantic proof for cut-elimination and completeness of various first and higher order logics. (Q1603701) (← links)
- A small remark on Hilbert's finitist view of divisibility and Kanovich-Okada-Scedrov's logical analysis of real-time systems (Q2037979) (← links)
- A diagrammatic inference system with Euler circles (Q2255200) (← links)
- Corrigendum to: ``Inductive-data-type systems'' (Q2309415) (← links)
- (Q2863872) (← links)
- Husserl and Hilbert on Completeness and Husserl's Term Rewrite-based Theory of Multiplicity (Invited Talk) (Q2958371) (← links)
- (Q3044485) (← links)
- Weak Logical Constants and Second Order Definability of the Full-Strength Logical Constants (Q3211279) (← links)
- Semantics for "enough-certainty" and fitting's embedding of classical logic in S4 (Q5278422) (← links)
