Results 21 to 30 of about 12,179 (98)
Proof Theory and Ordered Groups
, 2017 Ordering theorems, characterizing when partial orders of a group extend to total orders, are used to generate hypersequent calculi for varieties of lattice-ordered groups (l-groups).
A Ciabattoni +20 more
core +1 more source
Tarski's influence on computer science
, 2006 The influence of Alfred Tarski on computer science was indirect but significant in a number of directions and was in certain respects fundamental. Here surveyed is the work of Tarski on the decision procedure for algebra and geometry, the method of ...
Prakash Panangaden, Solomon Feferman
core +2 more sources
Context Semantics, Linear Logic and Computational Complexity
, 2006 We show that context semantics can be fruitfully applied to the quantitative analysis of proof normalization in linear logic. In particular, context semantics lets us define the weight of a proof-net as a measure of its inherent complexity: it is both an
Lago, Ugo Dal
core +3 more sources
Integrable Renormalization I: the Ladder Case
, 2004 In recent years a Hopf algebraic structure underlying the process of renormalization in quantum field theory was found. It led to a Birkhoff factorization for (regularized) Hopf algebra characters, i.e. for Feynman rules.
Ebrahimi-Fard, Kurusch +2 more
core +1 more source
Double-Negation Elimination in Some Propositional Logics
, 2002 This article answers two questions (posed in the literature), each concerning the guaranteed existence of proofs free of double negation. A proof is free of double negation if none of its deduced steps contains a term of the form n(n(t)) for some term t,
Beeson, Michael +2 more
core +1 more source
Distilling Abstract Machines (Long Version) [PDF]
, 2014 It is well-known that many environment-based abstract machines can be seen as strategies in lambda calculi with explicit substitutions (ES). Recently, graphical syntaxes and linear logic led to the linear substitution calculus (LSC), a new approach to ES
Accattoli, Beniamino +2 more
core
Genomic Intelligence as Über Bio-Cybersecurity: The Gödel Sentence in Immuno-Cognitive Systems. [PDF]
Entropy (Basel), 2021 Markose SM.
europepmc +1 more source
Number theory, borderline dimension and extensive entropy in distributions of ranked data. [PDF]
PLoS One, 2022 Velarde C, Robledo A.
europepmc +1 more source
Perspectives for proof unwinding by programming languages techniques [PDF]
, 2016 In this chapter, we propose some future directions of work, potentially beneficial to Mathematics and its foundations, based on the recent import of methodology from the theory of programming languages into proof theory.
Ilik, Danko
core +3 more sources
Strengthening convex relaxations of 0/1-sets using Boolean formulas. [PDF]
Math Program, 2021 Fiorini S, Huynh T, Weltge S.
europepmc +1 more source