Results 71 to 80 of about 2,682,535 (254)
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
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
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
Cut free sequent calculus for logic S5n(ED)
Lietuvos Matematikos Rinkinys, 2010 Hilbert style, Gentzen style sequent and Kanger style sequent calculi for logic S5n(ED) are considered in this paper. Gentzen style sequent calculus is constructed and its equivalence with Hilbert style system is proved, getting soundness and ...
Haroldas Giedra
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
Intuitionistic fixed point theories over Heyting arithmetic [PDF]
, 2010 In this paper we show that an intuitionistic theory for fixed points is conservative over the Heyting arithmetic with respect to a certain class of formulas. This extends partly the result of mine.
Arai, Toshiyasu
core
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
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
Syntactic cut-elimination for common knowledge
Annals of Pure and Applied Logic, 2009 The logic of common knowledge has been formulated by Alberucci and Jäger in a sequential system with a rule of infinite premises so as to enjoy completeness, from which then follows the cut-elimination theorem indirectly. There are also several variations of the logic formulated in cut-free sequential systems but a syntactical cut-elimination proof has
Brünnler, Kai, Studer, Thomas
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