Results 31 to 40 of about 5,025 (226)
Circular Proofs as Session-Typed Processes: A Local Validity Condition [PDF]
Logical Methods in Computer Science, 2022 Proof theory provides a foundation for studying and reasoning about programming languages, most directly based on the well-known Curry-Howard isomorphism between intuitionistic logic and the typed lambda-calculus.
Farzaneh Derakhshan, Frank Pfenning
doaj +1 more source
Propositional Logics Complexity and the Sub-Formula Property [PDF]
Electronic Proceedings in Theoretical Computer Science, 2015 In 1979 Richard Statman proved, using proof-theory, that the purely implicational fragment of Intuitionistic Logic (M-imply) is PSPACE-complete.
Edward Hermann Haeusler
doaj +1 more source
A UNIFYING FIELD IN LOGICS: NEUTROSOPHIC LOGIC. NEUTROSOPHY, NEUTROSOPHIC SET, NEUTROSOPHIC PROBABILITY AND STATISTICS [PDF]
, 1995 In 1960s Abraham Robinson has developed the non-standard analysis, a formalization of analysis and a branch of mathematical logic, which rigorously defines the ...
SMARANDACHE, F.
core +1 more source
Minimal Systems of Temporal Logic
Axioms, 2020 The article discusses minimal temporal logic systems built on the basis of classical logic as well as intuitionistic logic. The constructions of these systems are discussed as well as their basic properties.
Dariusz Surowik
doaj +1 more source
Towards the Integration of an Intuitionistic First-Order Prover into Coq [PDF]
Electronic Proceedings in Theoretical Computer Science, 2016 An efficient intuitionistic first-order prover integrated into Coq is useful to replay proofs found by external automated theorem provers. We propose a two-phase approach: An intuitionistic prover generates a certificate based on the matrix ...
Fabian Kunze
doaj +1 more source
Proof-search of propositional intuitionistic logic sequents by means of classical logic calculus
Lietuvos Matematikos Rinkinys, 2008 In the paper, we define some classes of sequents of the propositional intuitionistic logic. These are classes of primarily and α-primarily reducible sequents. Then we show how derivability of these sequents in a propositional intuitionistic logic sequent
Romas Alonderis
doaj +1 more source
An Investigation into Intuitionistic Logic with Identity [PDF]
, 2019 We define Kripke semantics for propositional intuitionistic logic with Suszko’s identity (ISCI). We propose sequent calculus for ISCI along with cut-elimination theorem.
Chlebowski, Szymon +1 more
core +1 more source
Philosophical Foundations of Intuitionistic Logic [PDF]
Metaphysics, 2013 Intuitionistic logic, as a non-classical logic, encompasses the principles of logical reasoning which were used by L. E. J. Brouwer in developing his intuitionistic mathematics.
L Nabavi, MA Hojati, H Alaeenezhad
doaj +1 more source
, 2011 Trillas et al. (1999, Soft computing, 3 (4), 197–199) and Trillas and Cubillo (1999, On non-contradictory input/output couples in Zadeh's CRI proceeding, 28–32) introduced the study of contradiction in the framework of fuzzy logic because of the ...
Torres Blanc, Carmen +5 more
core +1 more source
From Intuitionism to Brouwer's Modal Logic
Bulletin of the Section of Logic, 2020 We try to translate the intuitionistic propositional logic INT into Brouwer's modal logic KTB. Our translation is motivated by intuitions behind Brouwer's axiom p →☐◊p The main idea is to interpret intuitionistic implication as modal strict implication ...
Zofia Kostrzycka
doaj +1 more source