English
Related papers

Related papers: Priority arguments via true strages

200 papers

We define a sound and complete proof system for affine beta-eta-retractions in simple types built over many atoms, and we state simple necessary conditions for arbitrary beta-eta-retractions in simple and polymorphic types.

Logic in Computer Science · Computer Science 2007-05-23 Laurent Regnier , Pawel Urzyczyn

The purpose of this article is to prove that the forcing axiom for completely proper forcings is inconsistent with the Continuum Hypothesis. This answers a longstanding problem of Shelah. The corresponding completely proper forcing which…

Logic · Mathematics 2012-08-06 Justin Tatch Moore

We present ABA+, a new approach to handling preferences in a well known structured argumentation formalism, Assumption-Based Argumentation (ABA). In ABA+, preference information given over assumptions is incorporated directly into the…

Artificial Intelligence · Computer Science 2016-10-13 Kristijonas Čyras , Francesca Toni

The purpose of this note is to present my understanding of Tim Austin's proof of the multiple ergodic theorem for commuting transformations, emphasizing on the use of joinings, extensions and factors. The existence of a sated extension,…

Dynamical Systems · Mathematics 2009-10-16 Thierry De la Rue

This work presents a newly renovated approach to the analysis of second-order Riccati equations from the point of view of the theory of Lie systems. We show that these equations can be mapped into Lie systems through certain Legendre…

Mathematical Physics · Physics 2012-04-05 J. F. Cariñena , J. de Lucas , C. Sardón

We introduce a simplified framework for ord-transitive models and Shelah's non elementary proper (nep) theory. We also introduce a new construction for the countable support nep iteration.

Logic · Mathematics 2015-09-07 Jakob Kellner

We introduce A-ranked preferential structures and combine them with an accessibility relation. This framework allows us to formalize contrary to duty obligations. Representation results are proved.

Logic · Mathematics 2008-08-25 Dov Gabbay , Karl Schlechta

We give a new simple proof of the decidability of the First Order Theory of (omega^omega^i,+) and the Monadic Second Order Theory of (omega^i,<), improving the complexity in both cases. Our algorithm is based on tree automata and a new…

Computer Science and Game Theory · Computer Science 2007-05-23 Thierry Cachat

We investigate combinations of structures by families of structures relative to families of unary predicates and equivalence relations. Conditions preserving $\omega$-categoricity and Ehrenfeuchtness under these combinations are…

Logic · Mathematics 2016-01-05 Sergey V. Sudoplatov

We investigate infinitary wellfounded systems for linear logic with fixed points, with transfinite branching rules indexed by some closure ordinal $\alpha$ for fixed points. Our main result is that provability in the system for some…

Logic · Mathematics 2026-02-24 Anupam Das , Tikhon Pshenitsyn

This paper investigates under which conditions instantiation-based proof procedures can be combined in a nested way, in order to mechanically construct new instantiation procedures for richer theories. Interesting applications in the field…

Artificial Intelligence · Computer Science 2011-07-26 Mnacho Echenim , Nicolas Peltier

We consider methods for aggregating preferences that are based on the resolution of discrete optimization problems. The preferences are represented by arbitrary binary relations (possibly weighted) or incomplete paired comparison matrices.…

Optimization and Control · Mathematics 2007-05-23 Pavel Chebotarev , Elena Shamis

By algorithmic metatheorems for a model checking problem P over infinite-state systems we mean generic results that can be used to infer decidability (possibly complexity) of P not only over a specific class of infinite systems, but over a…

Logic in Computer Science · Computer Science 2009-10-28 Anthony Widjaja To , Leonid Libkin

A formal sequent system dealing with Menelaus' configurations is introduced in this paper. The axiomatic sequents of the system stem from 2-cycles of Delta-complexes. The Euclidean and projective interpretations of the sequents are defined…

We give another bit of evidence that forcing axioms provide proper framework for rigidity of quotient structures, by improving the OCA lifting theorem proved by the author in late 20th century and greatly simplifying its proof. In the…

Logic · Mathematics 2025-07-10 Ilijas Farah

In this paper we develop a structure called Link Algebra, in which we present a Set with two binary operations and an axiom system developed from the study of graph theory and set/antiset theory, sowing main theorems and definitions. Once…

Rings and Algebras · Mathematics 2011-03-22 Alfonso Bustamante

Graph-based representations of images have recently acquired an important role for classification purposes within the context of machine learning approaches. The underlying idea is to consider that relevant information of an image is…

Machine Learning · Computer Science 2011-06-07 Alejandro Chinea , Elka Korutcheva

In many applications such as rationing medical care and supplies, university admissions, and the assignment of public housing, the decision of who receives an allocation can be justified by various normative criteria. Such settings have…

Computer Science and Game Theory · Computer Science 2023-05-30 Siddhartha Banerjee , Matthew Eichhorn , David Kempe

In this paper we attack the Erdos-Straus conjecture by means of the structure of its solutions, extending and improving the results of a previous paper. Using previous results and supported by the works of Elsholtz and Tao and Monks and…

Number Theory · Mathematics 2024-04-17 Miguel Angel Lopez

We introduce "chain by chain" method for constructing the constraint structure of a system possessing both first and second class constraints. We show that the whole constraints can be classified into completely irreducible first or second…

High Energy Physics - Theory · Physics 2009-10-31 F Loran , A Shirzad