Pages that link to "Item:Q1603701"

The following pages link to A uniform semantic proof for cut-elimination and completeness of various first and higher order logics. (Q1603701):

Displaying 29 items.

• Algebraic proof theory for substructural logics: cut-elimination and completions (Q409322) (← links)
• Phase semantics and decidability of elementary affine logic (Q596037) (← links)
• Cut elimination and strong separation for substructural logics: an algebraic approach (Q636346) (← links)
• Kripke models for classical logic (Q636371) (← links)
• A simple proof that super-consistency implies cut elimination (Q691121) (← links)
• The bounded proof property via step algebras and step frames (Q741087) (← links)
• Towards a semantic characterization of cut-elimination (Q817704) (← links)
• Phase semantics and Petri net interpretation for resource-sensitive strong negation (Q1006444) (← links)
• Phase semantics for light linear logic (Q1398478) (← links)
• Phase semantic cut-elimination and normalization proofs of first- and higher-order linear logic (Q1575865) (← links)
• Completeness and cut-elimination theorems for high-order classical logic. Constructive method (Q1901891) (← links)
• Completeness of second-order intuitionistic propositional logic with respect to phase semantics for proof-terms (Q2000674) (← links)
• Hyper-MacNeille completions of Heyting algebras (Q2062218) (← links)
• Logic and majority voting (Q2121481) (← links)
• Dynamic non-commutative logic (Q2268354) (← links)
• A unifying principle for clause elimination in first-order logic (Q2405255) (← links)
• Gentzen-type calculi for involutive quantales (Q2575479) (← links)
• On the convergence of reduction-based and model-based methods in proof theory (Q2866742) (← links)
• Orthogonality and Boolean Algebras for Deduction Modulo (Q3007658) (← links)
• A Constructive Semantic Approach to Cut Elimination in Type Theories with Axioms (Q3540178) (← links)
• Forcing-Based Cut-Elimination for Gentzen-Style Intuitionistic Sequent Calculus (Q3638285) (← links)
• Forcing in Proof Theory (Q4678943) (← links)
• (Q4840168) (← links)
• A semantic proof of strong cut-admissibility for first-order Godel logic (Q4914412) (← links)
• Syntactic Completeness of Proper Display Calculi (Q5056369) (← links)
• MacNeille Completion and Buchholz' Omega Rule for Parameter-Free Second Order Logics (Q5079762) (← links)
• A Semantic Proof that Reducibility Candidates entail Cut Elimination (Q5111901) (← links)
• On the unification of classical, intuitionistic and affine logics (Q5236553) (← links)
• Constructive decision via redundancy-free proof-search (Q5919012) (← links)