Results 11 to 20 of about 4,006 (251)
The Cut-Elimination Theorem for Differential Nets with Promotion
, 2009 Recently Ehrhard and Regnier have introduced Differential Linear Logic, DiLL for short -- an extension of the Multiplicative Exponential fragment of Linear Logic that is able to express non-deterministic computations. The authors have examined the cut-elimination of the promotion-free fragment of DiLL by means of a proofnet-like calculus: differential ...
Michele Pagani, Pagani, Michele
openaire +3 more sources
A Mechanized Proof of the Max-Flow Min-Cut Theorem for Countable Networks [PDF]
, 2021 Aharoni et al. [Ron Aharoni et al., 2010] proved the max-flow min-cut theorem for countable networks, namely that in every countable network with finite edge capacities, there exists a flow and a cut such that the flow saturates all outgoing edges of the
Lochbihler, Andreas
core +1 more source
Cut loci and conjugate loci on Liouville surfaces [PDF]
, 2011 In the earlier paper (Itoh and Kiyohara, Manuscr Math 114:247–264, 2004), we showed that the cut locus of a general point on two-dimensional ellipsoid is a segment of a curvature line and proved "Jacobi’s last geometric statement" on the singularities of
Jin-ichi Itoh +3 more
core +1 more source
The cut elimination theorem in the unary second order language [PDF]
Proceedings of the American Mathematical Society, 1966 ln [T], Takeuti has conjectured that the cut elimination theorem holds for the simple theory of types cast in the sequent calculus. This conjecture is true for the first order language, as Gentzen had shown in [G]. (Indeed, the conjecture was made after Gentzen had proved his "Hauptsatz.") The purpose of this Note is to show that the conjecture is true
openaire +2 more sources
Constructive Cut Elimination in Geometric Logic [PDF]
, 2022 A constructivisation of the cut-elimination proof for sequent calculi for classical and intuitionistic infinitary logic with geometric rules - given in earlier work by the second author - is presented.
Giulio Fellin +5 more
core +1 more source
Aspects of the Cut-Elimination Theorem
, 2021 I give a proof of the cut-elimination theorem (Gentzen's Hauptsatz ) for an intuitionistic multi-succedent calculus. The proof follows the strategy of eliminating topmost maximal-rank cuts that allows for a straightforward way to measure the upper bound ...
Rýdl, Jiří
core
Kripke-Completeness and Cut-elimination Theorems for Intuitionistic Paradefinite Logics With and Without Quasi-Explosion [PDF]
Journal of Philosophical Logic, 2020 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
A cut elimination theorem for stationary logic
Annals of Pure and Applied Logic, 1987 We develop a complete cut-free labelled sequent calculus for stationary logic and prove that in the given formalization, this logic has the subformula property. The necessary parameter restrictions on the rules of inference involved explain the compatibility of this result with the known failure of interpolation for stationary logic.
openaire +2 more sources
Some remarks on proof-theoretic semantics
, 2015 This is a tripartite work. The first part is a brief discussion of what it is to be a logical constant, rejecting a view that allows a particular self-referential “constant” • to be such a thing in favour of a view that leads to strong normalisation ...
Roy Dyckhoff, Dyckhoff, Roy
core +1 more source
Waveguide Photoactuators: Materials, Fabrication, and Applications
Advanced Robotics Research, EarlyView.Waveguide photoactuators convert guided light into mechanical motion. Their tethered‐flexible design enables minimally invasive surgery and confined‐space robotics. This review aims to guide materials selection, device design, and system integration, accelerating the transition of waveguide photoactuators from laboratory prototypes to versatile ...
Minjie Xi +4 more
wiley +1 more source