Sciweavers

414 search results - page 3 / 83
» Resolution for Intuitionistic Logic
Sort
View
WOLLIC
2009
Springer
14 years 2 months ago
Forcing-Based Cut-Elimination for Gentzen-Style Intuitionistic Sequent Calculus
We give a simple intuitionistic completeness proof of Kripke semantics with constant domain for intuitionistic logic with implication and universal quantification. We use a cut-fr...
Hugo Herbelin, Gyesik Lee
TYPES
2000
Springer
13 years 11 months ago
Collection Principles in Dependent Type Theory
We introduce logic-enriched intuitionistic type theories, that extend intuitionistic dependent type theories with primitive judgements to express logic. By adding type theoretic ru...
Peter Aczel, Nicola Gambino
LICS
2010
IEEE
13 years 6 months ago
An Intuitionistic Logic that Proves Markov's Principle
—We design an intuitionistic predicate logic that supports a limited amount of classical reasoning, just enough to prove a variant of Markov’s principle suited for predicate lo...
Hugo Herbelin
IGPL
2008
85views more  IGPL 2008»
13 years 7 months ago
Independent Bases of Admissible Rules
We show that IPC, K4, GL, and S4, as well as all logics inheriting their admissible rules, have independent bases of admissible rules. Key words: admissible rule, independent basi...
Emil Jerábek
APAL
2007
71views more  APAL 2007»
13 years 7 months ago
A lower bound for intuitionistic logic
We give an exponential lower bound on number of proof-lines in intuitionistic propositional logic, IL, axiomatised in the usual Frege-style fashion; i.e., we give an example of IL...
Pavel Hrubes