Kripke Models for Classical Logic (2009)
Ilik, Danko, Lee, Gyesik, Herbelin, Hugo
We introduce a notion of Kripke model for classical logic for which we constructively prove soundness and cut-free completeness. We discuss the novelty of the notion and its potential applications.
Kripke Models for Classical Logic (2009)
Ilik, Danko, Lee, Gyesik, Herbelin, Hugo
We introduce a notion of Kripke model for classical logic for which we constructively prove soundness and cut-free completeness. We discuss the novelty of the notion and its potential applications.
Kripke Models for Classical Logic (2009)
Ilik, Danko, Lee, Gyesik, Herbelin, Hugo
We introduce a notion of Kripke model for classical logic for which we constructively prove soundness and cut-free completeness. We discuss the novelty of the notion and its potential applications.
Forcing-based cut-elimination for Gentzen-style intuitionistic sequent calculus (2009)
We give a simple intuitionistic completeness proof of Kripke semantics for intuitionistic logic with implication and universal quantification with respect to cut-free intuitionistic sequent calculus....
Forcing-based cut-elimination for Gentzen-style intuitionistic sequent calculus (2009)
We give a simple intuitionistic completeness proof of Kripke semantics for intuitionistic logic with implication and universal quantification with respect to cut-free intuitionistic sequent calculus....
Kripke Models for Classical Logic (2009)
Ilik, Danko, Lee, Gyesik, Herbelin, Hugo
We introduce a notion of Kripke model for classical logic for which we constructively prove soundness and cut-free completeness. We discuss the novelty of the notion and its potential applications.
Kripke Models for Classical Logic (2009)
Ilik, Danko, Lee, Gyesik, Herbelin, Hugo
We introduce a notion of Kripke model for classical logic for which we constructively prove soundness and cut-free completeness. We discuss the novelty of the notion and its potential applications.
Kripke Models for Classical Logic (2009)
Ilik, Danko, Lee, Gyesik, Herbelin, Hugo
We introduce a notion of Kripke model for classical logic for which we constructively prove soundness and cut-free completeness. We discuss the novelty of the notion and its potential applications.
Forcing-based cut-elimination for Gentzen-style intuitionistic sequent calculus (2009)
We give a simple intuitionistic completeness proof of Kripke semantics for intuitionistic logic with implication and universal quantification with respect to cut-free intuitionistic sequent calculus....
Kripke Models for Classical Logic (2009)
Ilik, Danko, Lee, Gyesik, Herbelin, Hugo
We introduce a notion of Kripke model for classical logic for which we constructively prove soundness and cut-free completeness. We discuss the novelty of the notion and its potential applications.
Forcing-based cut-elimination for Gentzen-style intuitionistic sequent calculus (2009)
We give a simple intuitionistic completeness proof of Kripke semantics for intuitionistic logic with implication and universal quantification with respect to cut-free intuitionistic sequent calculus....
Binary trees and (maximal) order types (2008)
Abstract. Concerning the set of rooted binary trees, one shows that Higman’s Lemma and Dershowitz’s recursive path ordering can be used for the decision of its maximal order type according to the...
Sharp Thresholds for the Phase Transition between Primitive Recursive and (2008)
Ackermannian Ramsey Numbers, Menachem Kojman, Gyesik Lee, Eran Omri, Andreas Weiermann
We compute the sharp thresholds on g at which g-large and g-regressive Ramsey numbers cease to be primitive recursive and become Ackermannian. We also identify the threshold below which g-regressive...
Sharp Thresholds for the Phase Transition between Primitive Recursive and (2007)
Ackermannian Ramsey Numbers, Menachem Kojman, Gyesik Lee, Eran Omri, Andreas Weiermann
We compute the sharp thresholds on g at which g-large and g-regressive Ramsey numbers cease to be primitive recursive and become Ackermannian. We also identify the threshold below which g-regressive...
Phase transitions in axiomatic thought (2005)
Ein Aspekt dieser dissertation ist, einige bekannte Ordinalzahlbezeichnungssysteme für Peano Arithmetik zu untersuchen. Es wird gezeigt, dass Phasenübergänge in Bezug auf Beweisbarkeit und...
Phase transitions in axiomatic thought / (2005)
Münster (Westfalen), University, Diss., 2005 (Nicht für den Austausch).