Results 21 to 30 of about 228,061 (236)
Canonical Proof nets for Classical Logic [PDF]
, 2012 Proof nets provide abstract counterparts to sequent proofs modulo rule permutations; the idea being that if two proofs have the same underlying proof-net, they are in essence the same proof.
McKinley, Richard
core +2 more sources
Interaction and Depth against Nondeterminism in Proof Search [PDF]
Logical Methods in Computer Science, 2014 Deep inference is a proof theoretic methodology that generalizes the standard notion of inference of the sequent calculus, whereby inference rules become applicable at any depth inside logical expressions.
Ozan Kahramanogullari
doaj +1 more source
Proving Noninterference by a Fully Complete Translation to the Simply Typed lambda-calculus [PDF]
Logical Methods in Computer Science, 2008 Tse and Zdancewic have formalized the notion of noninterference for Abadi et al.'s DCC in terms of logical relations and given a proof of noninterference by reduction to parametricity of System F. Unfortunately, their proof contains errors in a key lemma
Naokata Shikuma, Atsushi Igarashi
doaj +1 more source
Extending the Extensional Lambda Calculus with Surjective Pairing is Conservative [PDF]
Logical Methods in Computer Science, 2006 We answer Klop and de Vrijer's question whether adding surjective-pairing axioms to the extensional lambda calculus yields a conservative extension. The answer is positive. As a byproduct we obtain a "syntactic" proof that the extensional lambda calculus
Kristian Stoevring
doaj +1 more source
Simulation in the call-by-need lambda-calculus with letrec [PDF]
, 2010 This paper shows the equivalence of applicative similarity and contextual approximation, and hence also of bisimilarity and contextual equivalence, in the deterministic call-by-need lambda calculus with letrec.
Machkasova, Elena +2 more
core +1 more source
Proof Theory of Finite-valued Logics [PDF]
, 1993 The proof theory of many-valued systems has not been investigated to an extent comparable to the work done on axiomatizatbility of many-valued logics. Proof theory requires appropriate formalisms, such as sequent calculus, natural deduction, and tableaux
Zach, Richard
core +5 more sources
Divergence and unique solution of equations [PDF]
Logical Methods in Computer Science, 2019 We study proof techniques for bisimilarity based on unique solution of equations. We draw inspiration from a result by Roscoe in the denotational setting of CSP and for failure semantics, essentially stating that an equation (or a system of equations ...
Adrien Durier +2 more
doaj +1 more source
A Complete Axiomatisation for Quantifier-Free Separation Logic [PDF]
Logical Methods in Computer Science, 2021 We present the first complete axiomatisation for quantifier-free separation logic. The logic is equipped with the standard concrete heaplet semantics and the proof system has no external feature such as nominals/labels.
Stéphane Demri +2 more
doaj +1 more source
Standardization and Conservativity of a Refined Call-by-Value lambda-Calculus [PDF]
Logical Methods in Computer Science, 2017 We study an extension of Plotkin's call-by-value lambda-calculus via two commutation rules (sigma-reductions). These commutation rules are sufficient to remove harmful call-by-value normal forms from the calculus, so that it enjoys elegant ...
Giulio Guerrieri +2 more
doaj +1 more source
Proof Complexity of Propositional Default Logic [PDF]
, 2010 Default logic is one of the most popular and successful formalisms for non-monotonic reasoning. In 2002, Bonatti and Olivetti introduced several sequent calculi for credulous and skeptical reasoning in propositional default logic.
Beyersdorff, O +4 more
core +3 more sources