English
Related papers

Related papers: Cumulativity without closure of the domain under f…

200 papers

Cumulative logics are studied in an abstract setting, i.e., without connectives, very much in the spirit of Makinson's early work. A powerful representation theorem characterizes those logics by choice functions that satisfy a weakening of…

Artificial Intelligence · Computer Science 2007-05-23 Daniel Lehmann

This note is concerned with a formal analysis of the problem of non-monotonic reasoning in intelligent systems, especially when the uncertainty is taken into account in a quantitative way. A firm connection between logic and probability is…

Artificial Intelligence · Computer Science 2013-04-05 Hung-Trung Nguyen

In this paper, we study non-Newtonian fluids in a class of unbounded domains with noncompact boundaries. With respect to the resulting mathematical problems, we establish the global existence of solutions with arbitrary large flux under…

Analysis of PDEs · Mathematics 2016-11-24 Jiaqi Yang , Huicheng Yin

We show that countable increasing unions preserve a large family of well-studied covering properties, which are not necessarily sigma-additive. Using this, together with infinite-combinatorial methods and simple forcing theoretic methods,…

General Topology · Mathematics 2018-04-06 Tal Orenshtein , Boaz Tsaban

The well posedness for a class of non local systems of conservation laws in a bounded domain is proved and various stability estimates are provided. This construction is motivated by the modelling of crowd dynamics, which also leads to…

Analysis of PDEs · Mathematics 2017-11-15 Elena Rossi , Rinaldo M. Colombo

Argumentation is a non-monotonic process. This reflects the fact that argumentation involves uncertain information, and so new information can cause a change in the conclusions drawn. However, the base logic does not need to be…

Artificial Intelligence · Computer Science 2018-09-05 Anthony Hunter

The Expansion property considered by researchers in Social Choice is shown to correspond to a logical property of nonmonotonic consequence relations that is the {\em pure}, i.e., not involving connectives, version of a previously known weak…

Artificial Intelligence · Computer Science 2007-05-23 Daniel Lehmann

We argue that the finiteness of quantum gravity amplitudes in fully compactified theories (at least in supersymmetric cases) leads to a bottom-up prediction for the existence of non-trivial dualities. In particular, finiteness requires the…

High Energy Physics - Theory · Physics 2025-08-20 Matilda Delgado , Damian van de Heisteeg , Sanjay Raman , Ethan Torres , Cumrun Vafa , Kai Xu

In this paper we continue an earlier study of ends non-compact manifolds. The over-arching goal is to investigate and obtain generalizations of Siebenmann's famous collaring theorem that may be applied to manifolds having non-stable…

Geometric Topology · Mathematics 2014-11-11 C R Guilbault , F C Tinsley

A condition, in two variants, is given such that if a property P satisfies this condition, then every logic which is at least as strong as first-order logic and can express P fails to have the compactness property. The result is used to…

Logic · Mathematics 2013-04-15 Vera Koponen

A ring has bounded factorizations if every cancellative nonunit $a \in R$ can be written as a product of atoms and there is a bound $\lambda(a)$ on the lengths of such factorizations. The bounded factorization property is one of the most…

Rings and Algebras · Mathematics 2026-01-13 Jason P. Bell , Ken Brown , Zahra Nazemian , Daniel Smertnig

Simple argument in favour of unitarity, to all orders, of space-like noncommutative theory is given.

High Energy Physics - Theory · Physics 2007-05-23 Piotr Kosinski , Pawel Maslanka

Nonmonotonic reasoning is a pattern of reasoning that allows an agent to make and retract (tentative) conclusions from inconclusive evidence. This paper gives a possible-worlds interpretation of the nonmonotonic reasoning problem based on…

Artificial Intelligence · Computer Science 2013-04-10 Carl Kadie

We show that a singularity can occur at a finite future time in an expanding Friedmann universe even when the density is positive and the density plus the sum of the principal pressures is positive. Explicit examples are constructed and a…

General Relativity and Quantum Cosmology · Physics 2009-11-10 John D. Barrow

In this paper, we study aggregation rules with nontrivial symmetric classes of invariant sets (restricted domains), assuming that they, unlike others, have a logical nature. In the simplest case, we provide a complete classification of such…

Theoretical Economics · Economics 2026-04-03 Nikolay L. Poliakov

We continue the study of non-invertible topological dynamical systems with expanding behavior. We introduce the class of {\em finite type} systems which are characterized by the condition that, up to rescaling and uniformly bounded…

Dynamical Systems · Mathematics 2016-06-22 Peter Haïssinsky , Kevin M. Pilgrim

Admissible rules are shown to be conservatively preserved by the meet-combination of a wide class of logics. A basis is obtained for the resulting logic from bases given for the component logics. Structural completeness and decidability of…

Logic · Mathematics 2016-12-19 Joao Rasga , Cristina Sernadas , Amilcar Sernadas

We study acts and modules of maximal growth over finitely generated free monoids and free associative algebras as well as free groups and free group algebras. The maximality of the growth implies some other specific properties of these acts…

Group Theory · Mathematics 2014-02-26 Yuri Bahturin , Alexander Olshanskii

Given a set of conflicting arguments, there can exist multiple plausible opinions about which arguments should be accepted, rejected, or deemed undecided. We study the problem of how multiple such judgments can be aggregated. We define the…

Artificial Intelligence · Computer Science 2017-06-20 Edmond Awad , Richard Booth , Fernando Tohme , Iyad Rahwan

We present a sequent calculus system for a modal reformulation of a system of nonmonotonic logic due to McCain and Turner: we prove cut elimination for our system. The proof system is in general infinitary: because we can prove cut…

Logic · Mathematics 2008-01-29 Graham White
‹ Prev 1 2 3 10 Next ›