Results 31 to 40 of about 2,494,307 (343)
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
PROOFTOOL: a GUI for the GAPT Framework [PDF]
Electronic Proceedings in Theoretical Computer Science, 2013 This paper introduces PROOFTOOL, the graphical user interface for the General Architecture for Proof Theory (GAPT) framework. Its features are described with a focus not only on the visualization but also on the analysis and transformation of proofs and ...
Cvetan Dunchev +6 more
doaj +1 more source
Unique perfect matchings, forbidden transitions and proof nets for linear logic with Mix [PDF]
Logical Methods in Computer Science, 2020 This paper establishes a bridge between linear logic and mainstream graph theory, building on previous work by Retor\'e (2003). We show that the problem of correctness for MLL+Mix proof nets is equivalent to the problem of uniqueness of a perfect ...
Lê Thành Dũng Nguyên
doaj +1 more source
Constructive pointfree topology eliminates non-constructive representation theorems from Riesz space theory [PDF]
, 2008 In Riesz space theory it is good practice to avoid representation theorems which depend on the axiom of choice. Here we present a general methodology to do this using pointfree topology.
AC Zaanen +25 more
core +4 more sources
The zeroth law of black hole thermodynamics in arbitrary higher derivative theories of gravity
Journal of High Energy Physics, 2022 We consider diffeomorphism invariant theories of gravity with arbitrary higher derivative terms in the Lagrangian as corrections to the leading two derivative theory of Einstein’s general relativity.
Sayantani Bhattacharyya +3 more
doaj +1 more source
Majority is Stablest : Discrete and SoS [PDF]
, 2012 The Majority is Stablest Theorem has numerous applications in hardness of approximation and social choice theory. We give a new proof of the Majority is Stablest Theorem by induction on the dimension of the discrete cube.
De, Anindya +2 more
core +3 more sources
A proof theory for generic judgments: an extended abstract [PDF]
18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings., 2003 A powerful and declarative means of specifying computations containing abstractions involves meta-level, universally quantified generic judgments. We present a proof theory for such judgments in which signatures are associated to each sequent (used to account for eigenvariables of sequent) and to each formula in the sequent (used to account for generic
D. Miller, A. Tiu
openaire +1 more source
Galois theory for general systems of polynomial equations [PDF]
Compositio Mathematica, 2018 We prove that the monodromy group of a reduced irreducible square system of general polynomial equations equals the symmetric group. This is a natural first step towards the Galois theory of general systems of polynomial equations, because arbitrary ...
Alexander Esterov
semanticscholar +1 more source
A Theory for Abstract Reduction Systems in PVS
CLEI Electronic Journal, 2008 A theory for Abstract Reduction Systems (ARS) in the proof assistant PVS (Prototype Verification System) called ars is described. Adequate specifications of basic definitions and notions of the theory of ARSs such as reduction, confluence and normal form
Andre Luiz Galdino +1 more
doaj +1 more source
Characterization of incentive compatible single-parameter mechanisms revisited
Journal of Mechanism and Institution Design, 2022 We reexamine the characterization of incentive compatible single-parameter mechanisms introduced in Archer and Tardos (2001). We argue that the claimed uniqueness result, called 'Myerson's Lemma' was not well established.
Krzysztof R. Apt, Jan Heering
doaj +1 more source