Results 21 to 30 of about 165,990,627 (290)
Formalising the pi-calculus using nominal logic [PDF]
Logical Methods in Computer Science, 2009 We formalise the pi-calculus using the nominal datatype package, based on ideas from the nominal logic by Pitts et al., and demonstrate an implementation in Isabelle/HOL.
Jesper Bengtson, Joachim Parrow
doaj +1 more source
Lietuvos Matematikos Rinkinys, 2023 Usually, proofs of mathematical statements involve both algebraic rearrangements and logical reasoning. But there are mathematical statements whose truth is obvious at first glance when there is a diagram illustrating that proof.
Edmundas Mazėtis +1 more
doaj +3 more sources
Typed realizability for first-order classical analysis [PDF]
Logical Methods in Computer Science, 2015 We describe a realizability framework for classical first-order logic in which realizers live in (a model of) typed {\lambda}{\mu}-calculus.
Valentin Blot
doaj +1 more source
Globular: an online proof assistant for higher-dimensional rewriting [PDF]
Logical Methods in Computer Science, 2018 This article introduces Globular, an online proof assistant for the formalization and verification of proofs in higher-dimensional category theory. The tool produces graphical visualizations of higher-dimensional proofs, assists in their construction ...
Krzysztof Bar +2 more
doaj +1 more source
Two for the Price of One: Lifting Separation Logic Assertions [PDF]
Logical Methods in Computer Science, 2012 Recently, data abstraction has been studied in the context of separation logic, with noticeable practical successes: the developed logics have enabled clean proofs of tricky challenging programs, such as subject-observer patterns, and they have become ...
Jacob Thamsborg +2 more
doaj +1 more source
The Logic of Separation Logic: Models and Proofs
, 2023 AbstractThe standard semantics of separation logic is restricted to finite heaps. This restriction already gives rise to a logic which does not satisfy compactness, hence it does not allow for an effective, sound and complete axiomatization. In this paper we therefore study both the general model theory and proof theory of the separation logic of ...
F.S. de Boer (Frank) +2 more
openaire +3 more sources
Local Normal Forms for First-Order Logic with Applications to Games and Automata [PDF]
Discrete Mathematics & Theoretical Computer Science, 1999 Building on work of Gaifman [Gai82] it is shown that every first-order formula is logically equivalent to a formula of the form ∃ x 1,...,x l, ∀ y, φ where φ is r-local around y, i.e.
Thomas Schwentick, Klaus Barthelmann
doaj +2 more sources
Proof-graphs for Minimal Implicational Logic [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 It is well-known that the size of propositional classical proofs can be huge. Proof theoretical studies discovered exponential gaps between normal or cut free proofs and their respective non-normal proofs.
Marcela Quispe-Cruz +2 more
doaj +1 more source
Geometrisation of first-order logic [PDF]
, 2015 That every first-order theory has a coherent conservative extension is regarded by some as obvious, even trivial, and by others as not at all obvious, but instead remarkable and valuable; the result is in any case neither sufficiently well-known nor ...
Dyckhoff R. +3 more
core +1 more source
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