Results 31 to 40 of about 165,990,627 (290)
Semantic pollution and syntactic purity [PDF]
, 2015 Logical inferentialism claims that the meaning of the logical constants should be given, not model-theoretically, but by the rules of inference of a suitable calculus.
Read, Stephen
core +1 more source
Deriving Safety Cases from Automatically Constructed Proofs
, 2009 Formal proofs provide detailed justification for the validity of claims and are widely used in formal software development methods. However, they are often complex and difficult to understand, because the formalism in which they are constructed and ...
Fischer, Bernd +5 more
core +2 more sources
Inducing syntactic cut-elimination for indexed nested sequents [PDF]
Logical Methods in Computer Science, 2018 The key to the proof-theoretic study of a logic is a proof calculus with a subformula property. Many different proof formalisms have been introduced (e.g. sequent, nested sequent, labelled sequent formalisms) in order to provide such calculi for the many
Revantha Ramanayake
doaj +1 more source
Proof complexity of substructural logics
Annals of Pure and Applied Logic, 2021 34 ...
openaire +4 more sources
Cut-elimination, substitution and normalisation [PDF]
, 2014 Date of Acceptance: 01/2015We present a proof (of the main parts of which there is a formal version, checked with the Isabelle proof assistant) that, for a G3-style calculus covering all of intuitionistic zero-order logic, with an associated term ...
Roy Dyckhoff, Dyckhoff, Roy
core +1 more source
The Method of Socratic Proofs Meets Correspondence Analysis [PDF]
, 2019 The goal of this paper is to propose correspondence analysis as a technique for generating the so-called erotetic (i.e. pertaining to the logic of questions) calculi which constitute the method of Socratic proofs by Andrzej Wiśniewski.
Leszczyńska-Jasion, Dorota +2 more
core +2 more sources
Normativity and its vindication: The case of Logic [PDF]
, 2004 Physical laws are irresistible. Logical rules are not. That is why logic is said to be normative. Given a system of logic we have a Norma, a standard of correctness.
Martínez Vidal, Concha +1 more
core +1 more source
Proof Checking and Logic Programming [PDF]
Formal Aspects of Computing, 2015 Abstract In a world where trusting software systems is increasingly important, formal methods and formal proof can help provide some basis for trust. Proof checking can help to reduce the size of the trusted base since we do not need to trust an entire theorem prover: instead, we only need to trust a ...
openaire +4 more sources
Weak arithmetical interpretations for the Logic of Proofs [PDF]
, 2016 Artemov established an arithmetical interpretation for the Logics of Proofs LPCS, which yields a classical provability semantics for the modal logic S4. The Logics of Proofs are parameterized by so-called constant specifications CS, stating which axioms ...
Kuznets, Roman, Studer, Thomas
core +2 more sources
Game semantics for first-order logic [PDF]
Logical Methods in Computer Science, 2010 We refine HO/N game semantics with an additional notion of pointer (mu-pointers) and extend it to first-order classical logic with completeness results.
Olivier Laurent
doaj +1 more source