The following pages link to Kazushige Terui (Q271691):
Displayed 29 items.
- Densification of FL chains via residuated frames (Q271692) (← links)
- Algebraic proof theory for substructural logics: cut-elimination and completions (Q409322) (← links)
- Computational ludics (Q534713) (← links)
- Disjunction property and complexity of substructural logics (Q549720) (← links)
- MacNeille completions of FL-algebras (Q652517) (← links)
- Algebraic proof theory: hypersequents and hypercompletions (Q730091) (← links)
- Towards a semantic characterization of cut-elimination (Q817704) (← links)
- Light affine lambda calculus and polynomial time strong normalization (Q877259) (← links)
- Light types for polynomial time computation in lambda calculus (Q1004289) (← links)
- Light affine set theory: A naive set theory of polynomial time (Q1876088) (← links)
- On the Meaning of Focalization (Q3080087) (← links)
- On the meaning of logical completeness (Q3081446) (← links)
- From Focalization of Logic to the Logic of Focalization (Q3178251) (← links)
- Parsimonious Types and Non-uniform Computation (Q3449488) (← links)
- Verification of Ptime Reducibility for System F Terms Via Dual Light Affine Logic (Q3613335) (← links)
- On the Meaning of Logical Completeness (Q3637186) (← links)
- Expanding the Realm of Systematic Proof Theory (Q3644747) (← links)
- (Q4252643) (← links)
- The finite model property for various fragments of intuitionistic linear logic (Q4262585) (← links)
- (Q4703047) (← links)
- MacNeille Completion and Buchholz' Omega Rule for Parameter-Free Second Order Logics (Q5079762) (← links)
- Semantic Evaluation, Intersection Types and Complexity of Simply Typed Lambda Calculus (Q5111914) (← links)
- (Q5369470) (← links)
- Modular Cut-Elimination: Finding Proofs or Counterexamples (Q5387889) (← links)
- Which structural rules admit cut elimination? An algebraic criterion (Q5422301) (← links)
- Verification of Ptime Reducibility for system F Terms: Type Inference in Dual Light Affine Logic (Q5453503) (← links)
- Intuitionistic phase semantics is almost classical (Q5466794) (← links)
- Typed Lambda Calculi and Applications (Q5704029) (← links)
- Theoretical Computer Science (Q5897348) (← links)