Results 61 to 70 of about 578,113 (185)
On the Herbrand content of LK [PDF]
Electronic Proceedings in Theoretical Computer Science, 2016 We present a structural representation of the Herbrand content of LK-proofs with cuts of complexity prenex Sigma-2/Pi-2. The representation takes the form of a typed non-deterministic tree grammar of order 2 which generates a finite language of first ...
Bahareh Afshari +2 more
doaj +1 more source
Reasoning about Unreliable Actions [PDF]
, 2012 We analyse the philosopher Davidson's semantics of actions, using a strongly typed logic with contexts given by sets of partial equations between the outcomes of actions.
White, Graham
core
Elimination and cut-elimination in multiplicative linear logic
, 2022 We associate to every proof structure in multiplicative linear logic an ideal which represents the logical content of the proof as polynomial equations. We show how cut-elimination in multiplicative proof nets corresponds to instances of the Buchberger algorithm for computing Gröbner bases in elimination theory.
Murfet, Daniel, Troiani, William
openaire +2 more sources
Modified Anderson-Darling Test-Based Target Detector in Non-Homogenous Environments
Sensors, 2014 A constant false alarm rate (CFAR) target detector in non-homogenous backgrounds is proposed. Based on K-sample Anderson-Darling (AD) tests, the method re-arranges the reference cells by merging homogenous sub-blocks surrounding the cell under test (CUT)
Yang Li +3 more
doaj +1 more source
Multiplicative-Additive Proof Equivalence is Logspace-complete, via Binary Decision Trees [PDF]
Logical Methods in Computer Science, 2017 Given a logic presented in a sequent calculus, a natural question is that of equivalence of proofs: to determine whether two given proofs are equated by any denotational semantics, ie any categorical interpretation of the logic compatible with its cut ...
Marc Bagnol
doaj +1 more source
Consistency Without Cut Elimination
, 2002 In this note we will show how to get consistency for first order classical logic, in a purely syntactic way, without going through cut elimination. The procedure is very simple and it uses the calculus of structures in an essential way. It also shows how finitaryness (in the sense of finite choice of premises for each rule) is actually a triviality ...
Bruennler, Kai, Guglielmi, Alessio
openaire +2 more sources
Journal of Intercollegiate Sport, 2023 The purpose of this study was to examine changes to the budgets of women’s athletics, men’s basketball, and football when an NCAA Division I intercollegiate men’s team was eliminated. Stakeholder theory provided the theoretical framework for the study.
Anne Marx, Joel Cormier, Roman Ciapalo
doaj
On Constructive Connectives and Systems [PDF]
Logical Methods in Computer Science, 2010 Canonical inference rules and canonical systems are defined in the framework of non-strict single-conclusion sequent systems, in which the succeedents of sequents can be empty.
Arnon Avron, Ori Lahav
doaj +1 more source
Cut Elimination for a Logic with Induction and Co-induction [PDF]
, 2010 Proof search has been used to specify a wide range of computation systems. In order to build a framework for reasoning about such specifications, we make use of a sequent calculus involving induction and co-induction.
Momigliano, Alberto, Tiu, Alwen
core
Multirole Logic (Extended Abstract) [PDF]
, 2017 We identify multirole logic as a new form of logic in which conjunction/disjunction is interpreted as an ultrafilter on the power set of some underlying set (of roles) and the notion of negation is generalized to endomorphisms on this underlying set.
Wu, Hanwen, Xi, Hongwei
core