Results 1  10
of
11,345
Intuitionistic Logic
"... A Kripke model of intuitionistic predicate logic can be described (see [1]) as a quadruple.;((M, 4, 8, v) where (M, ~) is a poser (partially ordered set), ~ is a nondecreasing function associating a set of individual constants with each X E M, and for each X e M and each ..."
Abstract
 Add to MetaCart
A Kripke model of intuitionistic predicate logic can be described (see [1]) as a quadruple.;((M, 4, 8, v) where (M, ~) is a poser (partially ordered set), ~ is a nondecreasing function associating a set of individual constants with each X E M, and for each X e M and each
Skolemization in intuitionistic logic
 Annals of Pure and Applied Logic
"... In [2] an alternative skolemization method called eskolemization was introduced that is sound and complete for existence logic with respect to existential quantifiers. Existence logic is a conservative extension of intuitionistic logic by an existence predicate. Therefore eskolemization provides a s ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
In [2] an alternative skolemization method called eskolemization was introduced that is sound and complete for existence logic with respect to existential quantifiers. Existence logic is a conservative extension of intuitionistic logic by an existence predicate. Therefore eskolemization provides a
Dual intuitionistic logic revisited
 Automated Reasoning with Analytic Tableaux and Related Methods, St
, 2000
"... Abstract. We unify the algebraic, relational and sequent methods used by various authors to investigate “dual intuitionistic logic”. We show that restricting sequents to “singletons on the left/right ” cannot capture “intuitionistic logic with dual operators”, the natural hybrid logic that arises fr ..."
Abstract

Cited by 13 (1 self)
 Add to MetaCart
Abstract. We unify the algebraic, relational and sequent methods used by various authors to investigate “dual intuitionistic logic”. We show that restricting sequents to “singletons on the left/right ” cannot capture “intuitionistic logic with dual operators”, the natural hybrid logic that arises
Intuitionistic Logic in Business Systems
"... Abstract — Business computer systems model the real world where the absolute truth cannot always be established. This can lead to different points of view and a problem with client satisfaction. We consider intuitionistic logic as a more natural way for a business system to implement situational rea ..."
Abstract
 Add to MetaCart
Abstract — Business computer systems model the real world where the absolute truth cannot always be established. This can lead to different points of view and a problem with client satisfaction. We consider intuitionistic logic as a more natural way for a business system to implement situational
Semantics for subintuitionistic logics
, 2006
"... This paper exposes semantics for various subintuitionistic logics. The semantics transparently reflect how assumptions on the epistemic and cognitive abilities of the creative subject influences the underlying logic. One of these semantics is used to obtain a lower bound on the length of proofs of ..."
Abstract
 Add to MetaCart
This paper exposes semantics for various subintuitionistic logics. The semantics transparently reflect how assumptions on the epistemic and cognitive abilities of the creative subject influences the underlying logic. One of these semantics is used to obtain a lower bound on the length of proofs
Bisimulation and Propositional Intuitionistic Logic
 PROCEEDINGS OF THE 8TH INTERNATIONAL CONFERENCE ON CONCURRENCY THEORY
, 1996
"... The BrouwerHeytingKolmogorov interpretation of intuitionistic logic suggests that p oe q can be interpreted as a computation that given a proof of p constructs a proof of q. Dually, we show that every finite canonical model of q contains a finite canonical model of p. If q and p are interderivabl ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
The BrouwerHeytingKolmogorov interpretation of intuitionistic logic suggests that p oe q can be interpreted as a computation that given a proof of p constructs a proof of q. Dually, we show that every finite canonical model of q contains a finite canonical model of p. If q and p
An Intuitionistic Logic for Sequential Control
"... We introduce a propositional logic ICL, which adds to intuitionistic logic elements of classical reasoning without collapsing it into classical logic. This logic includes a new constant for false, which augments false in intuitionistic logic and in minimal logic. We define Kripke models for ICL and ..."
Abstract
 Add to MetaCart
We introduce a propositional logic ICL, which adds to intuitionistic logic elements of classical reasoning without collapsing it into classical logic. This logic includes a new constant for false, which augments false in intuitionistic logic and in minimal logic. We define Kripke models for ICL
Focusing and polarization in intuitionistic logic
 CSL 2007: Computer Science Logic, volume 4646 of LNCS
, 2007
"... dale.miller at inria.fr Abstract. A focused proof system provides a normal form to cutfree proofs that structures the application of invertible and noninvertible inference rules. The focused proof system of Andreoli for linear logic has been applied to both the proof search and the proof normaliza ..."
Abstract

Cited by 42 (17 self)
 Add to MetaCart
normalization approaches to computation. Various proof systems in literature exhibit characteristics of focusing to one degree or another. We present a new, focused proof system for intuitionistic logic, called LJF, and show how other proof systems can be mapped into the new system by inserting logical
Nested Sequents for Intuitionistic Logics
, 2011
"... Nested sequent systems for modal logics were introduced by Kai Brünnler, and have come to be seen as an attractive deep reasoning extension of familiar sequent calculi. In an earlier paper I showed there was a connection between modal nested sequents and modal prefixed tableaus. In this paper I exte ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
extend the nested sequent machinery to intuitionistic logic, both standard and constant domain, and relate the resulting sequent calculi to intuitionistic prefixed tableaus. Modal nested sequent machinery generalizes one sided sequent calculi—the present work similarly generalizes two sided sequents
Towards CERes in intuitionistic logic
"... Cutelimination, introduced by Gentzen, plays an important role in automating the analysis of mathematical proofs. The removal of cuts corresponds to the elimination of intermediate statements (lemmas), resulting in an analytic proof. CERes is a method of cutelimination by resolution that relies on ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
, and it is fully developed for classical logic (first and higher order), multivalued logics and Gödel logic. But when it comes to mathematical proofs, intuitionistic logic also plays an important role due to its constructive characteristics and computational interpretation. This paper presents current
Results 1  10
of
11,345