Results 31 to 40 of about 4,888,581 (309)
Glueability of Resource Proof-Structures: Inverting the Taylor Expansion [PDF]
, 2019 A Multiplicative-Exponential Linear Logic (MELL) proof-structure can be expanded into a set of resource proof-structures: its Taylor expansion. We introduce a new criterion characterizing those sets of resource proof-structures that are part of the ...
Guerrieri, Giulio +2 more
core +3 more sources
Revista Eletrônica de Direito Processual, 2020 The Judiciary, especially Labor, has been working to find a solution for the continuity of judicial activities remotely and telepresentially. The purpose of this article is to debate the importance of testimonial evidence in the telepresential work ...
Mauro Augusto Ponce de Leão Braga +1 more
doaj +1 more source
Proof verification and hardness of approximation problems
Proceedings., 33rd Annual Symposium on Foundations of Computer Science, 1992 The class PCP(f(n),g(n)) consists of all languages L for which there exists a polynomial-time probabilistic oracle machine that used O(f(n)) random bits, queries O(g(n)) bits of its oracle and behaves as follows: If x in L then there exists an oracle y ...
Sanjeev Arora +4 more
semanticscholar +1 more source
, 2017 Proof theory began in the 1920's as a part of Hilbert's program, which aimed to secure the foundations of mathematics by modeling infinitary mathematics with formal axiomatic systems and proving those systems consistent using restricted, finitary means ...
J. Avigad
semanticscholar +1 more source
A Labelled Sequent Calculus for BBI: Proof Theory and Proof Search
, 2015 We present a labelled sequent calculus for Boolean BI, a classical variant of O'Hearn and Pym's logic of Bunched Implication. The calculus is simple, sound, complete, and enjoys cut-elimination.
Gore, Rajeev, Hou, Zhe, Tiu, Alwen
core +1 more source
A Geometric Proof of Calibration [PDF]
, 2009 We provide yet another proof of the existence of calibrated forecasters; it has two merits. First, it is valid for an arbitrary finite number of outcomes.
Mannor, Shie, Stoltz, Gilles
core +6 more sources
, 2012 TLA+ is a specification language based on standard set theory and temporal logic that has constructs for hierarchical proofs. We describe how to write TLA+ proofs and check them with TLAPS, the TLA+ Proof System. We use Peterson's mutual exclusion algorithm as a simple example to describe the features of TLAPS and show how it and the Toolbox (an IDE ...
Cousineau, Denis +5 more
openaire +4 more sources
Temperature tests of cells - uncertainty considerations [PDF]
MATEC Web of ConferencesThe paper presents the estimation of the uncertainty in the measurement of the maximum surface temperature of voltaic cells exposed to specific tests for the type of intrinsic safety protection.
Darie Marius +4 more
doaj +1 more source
Proof Relevant Corecursive Resolution
, 2015 Resolution lies at the foundation of both logic programming and type class context reduction in functional languages. Terminating derivations by resolution have well-defined inductive meaning, whereas some non-terminating derivations can be understood ...
D Ancona +14 more
core +1 more source
A Communication Proof Equilibrium Concept [PDF]
, 1996 This paper proposes an equilibrium concept for the classes of environments in which players can communicate with each other but cannot make binding agreements.
Ferreira, José Luis
core +3 more sources