Results 21 to 30 of about 13,404,605 (326)

Algebraic Proof Theory for LE-logics [PDF]

open access: yesACM Transactions on Computational Logic, 2018
In this article, we extend the research programme in algebraic proof theory from axiomatic extensions of the full Lambek calculus to logics algebraically captured by certain varieties of normal lattice expansions (normal LE-logics).
G. Greco   +4 more
semanticscholar   +1 more source

Categorical Proof Theory of Co-Intuitionistic Linear Logic [PDF]

open access: yesLogical Methods in Computer Science, 2014
To provide a categorical semantics for co-intuitionistic logic one has to face the fact, noted by Tristan Crolard, that the definition of co-exponents as adjuncts of coproducts does not work in the category Set, where coproducts are disjoint unions ...
Gianluigi Bellin
doaj   +1 more source

DEVELOPING PROOF-BASED LEARNING USING APOS THEORY APPROACH IN EXPONENTIAL FOR ENHANCING STUDENTS’ REASONING ABILITY

open access: yesAksioma: Jurnal Program Studi Pendidikan Matematika, 2022
Proof-based learning is learning mathematics through proof and proving to strengthen students' concepts. The use of APOS theory (Action, Process, Object, and Schema) aims to describe students' mental structures summarized in Hypothetical Learning ...
Leonardo Jonathan Shinariko   +2 more
doaj   +1 more source

Tools and techniques for formalising structural proof theory [PDF]

open access: yes, 2010
Whilst results from Structural Proof Theory can be couched in many formalisms, it is the sequent calculus which is the most amenable of the formalisms to metamathematical treatment.
Chapman, Peter
core   +2 more sources

On linear rewriting systems for Boolean logic and some applications to proof theory [PDF]

open access: yesLog. Methods Comput. Sci., 2016
Linear rules have played an increasing role in structural proof theory in recent years. It has been observed that the set of all sound linear inference rules in Boolean logic is already coNP-complete, i.e. that every Boolean tautology can be written as a
Anupam Das, L. Straßburger
semanticscholar   +1 more source

The structure of logical consequence : proof-theoretic conceptions [PDF]

open access: yes, 2010
The model-theoretic analysis of the concept of logical consequence has come under heavy criticism in the last couple of decades. The present work looks at an alternative approach to logical consequence where the notion of inference takes center stage ...
Hjortland, Ole T.
core   +2 more sources

The RedPRL Proof Assistant (Invited Paper) [PDF]

open access: yesElectronic Proceedings in Theoretical Computer Science, 2018
RedPRL is an experimental proof assistant based on Cartesian cubical computational type theory, a new type theory for higher-dimensional constructions inspired by homotopy type theory.
Carlo Angiuli   +4 more
doaj   +1 more source

Reduction Free Normalisation for a proof irrelevant type of propositions [PDF]

open access: yesLogical Methods in Computer Science, 2023
We show normalisation and decidability of convertibility for a type theory with a hierarchy of universes and a proof irrelevant type of propositions, close to the type system used in the proof assistant Lean.
Thierry Coquand
doaj   +1 more source

The Fundamental Problem of General Proof Theory

open access: yesStudia Logica: An International Journal for Symbolic Logic, 2019
I see the question what it is that makes an inference valid and thereby gives a proof its epistemic power as the most fundamental problem of general proof theory.
D. Prawitz
semanticscholar   +1 more source

Intuitionistic Layered Graph Logic: Semantics and Proof Theory [PDF]

open access: yesLogical Methods in Computer Science, 2018
Models of complex systems are widely used in the physical and social sciences, and the concept of layering, typically building upon graph-theoretic structure, is a common feature.
Simon Docherty, David Pym
doaj   +1 more source

Home - About - Disclaimer - Privacy