English
Related papers

Related papers: On first-species counterpoint theory

200 papers

There are two natural and well-studied approaches to temporal ontology and reasoning: point-based and interval-based. Usually, interval-based temporal reasoning deals with points as a particular case of duration-less intervals. A recent…

Logic in Computer Science · Computer Science 2023-06-22 Willem Conradie , Salih Durhan , Guido Sciavicco

We present an abstract unifying framework for interpreting Stone-type dualities; several known dualities are seen to be instances of just one topos-theoretic phenomenon, and new dualities are introduced. In fact, infinitely many new…

Category Theory · Mathematics 2011-04-06 Olivia Caramello

We construct a commutative version of the group ring and show that it allows one to translate questions about the normal generation of groups into questions about the generation of ideals in commutative rings. We demonstrate this with an…

Group Theory · Mathematics 2023-12-22 Wajid Mannan

We give sufficient conditions for a first order expansion of the real line to define the standard model of the monadic second order theory of one successor. Such an expansion does not satisfy any of the combinatorial tameness properties…

Logic · Mathematics 2016-12-07 Philipp Hieronymi , Erik Walsberg

We introduce the notions of definable amenability and extreme definable amenability for groups in continuous structures and conduct an extensive analysis of them, drawing parallels with the classical first-order case. We characterize both…

Logic · Mathematics 2025-04-03 Juan Felipe Carmona , Alf Onshuus

We define the class of multivariate group entropies as a novel set of information - theoretical measures, which extends significantly the family of group entropies. We propose new examples related to the "super-exponential" universality…

Mathematical Physics · Physics 2020-12-03 Piergiulio Tempesta

In the first part we show a counterexample to a conjecture by Shelah regarding the existence of indiscernible sequences in dependent theories (up to the first inaccessible cardinal). In the second part we discuss generic pairs, and give an…

Logic · Mathematics 2013-08-29 Itay Kaplan , Saharon Shelah

First passage under restart with branching is proposed as a generalization of first passage under restart. Strong motivation to study this generalization comes from the observation that restart with branching can expedite the completion of…

Statistical Mechanics · Physics 2019-01-23 Arnab Pal , Iddo Eliazar , Shlomi Reuveni

In this survey article we introduce the notion of frontals, which provides a class of generalised submanifolds with singularities but with well-defined tangent spaces. We present a review of basic theory and known studies on frontals in…

Differential Geometry · Mathematics 2016-09-05 Goo Ishikawa

This paper extends implication-space semantics to include first-order quantification. Implication-space semantics has recently been introduced as an inferentialist formal semantics that can capture nonmonotonic and nontransitive material…

Logic · Mathematics 2026-02-17 Ulf Hlobil

We present distributions of countable models and correspondent structural characteristics of complete theories with continuum many types: for prime models over finite sets relative to Rudin-Keisler preorders, for limit models over types and…

Logic · Mathematics 2012-10-16 Roman A. Popkov , Sergey V. Sudoplatov

We expose a rather simple and direct approach to the structure theory of prime PI-rings ("Posner's theorem"), based on fundamental properties of the extended centroid of a prime ring.

Rings and Algebras · Mathematics 2010-03-30 Matej Bresar

We continue investigating the structure of externally definable sets in NIP theories and preservation of NIP after expanding by new predicates. Most importantly: types over finite sets are uniformly definable; over a model, a family of…

Logic · Mathematics 2012-02-14 Artem Chernikov , Pierre Simon

We present a modification of the superposition calculus that is meant to generate consequences of sets of first-order axioms. This approach is proven to be sound and deductive-complete in the presence of redundancy elimination rules,…

Logic in Computer Science · Computer Science 2014-07-15 Mnacho Echenim , Nicolas Peltier

We introduce a simple generalization of Gardenfors and Makinson's epistemic entrenchment called partial entrenchment. We show that preferential inference can be generated as the sceptical counterpart of an inference mechanism defined…

Logic in Computer Science · Computer Science 2007-05-23 Konstantinos Georgatos

This paper presents preliminary work on a general system for integrating dependent types into substructural type systems such as linear logic and linear type theory. Prior work on this front has generally managed to deliver type systems…

Logic in Computer Science · Computer Science 2024-01-30 C. B. Aberlé

By a [$K$-]approximate subring of a ring we mean an additively symmetric subset $X$ such that $X \cdot X \cup (X + X)$ is covered by finitely many [resp.\ $K$] additive translates of $X$. We prove a structure theorem for finite approximate…

Rings and Algebras · Mathematics 2026-04-07 Krzysztof Krupiński , Simon Machado

Distributed representations (such as those based on embeddings) and discrete representations (such as those based on logic) have complementary strengths. We explore one possible approach to combining these two kinds of representations. We…

Artificial Intelligence · Computer Science 2015-02-06 Ramanathan Guha

Lewis' theory of counterfactuals is the foundation of many contemporary notions of causality. In this paper, we extend this theory in the temporal direction to enable symbolic counterfactual reasoning on infinite sequences, such as…

Logic in Computer Science · Computer Science 2023-06-16 Bernd Finkbeiner , Julian Siber

After surveying classical results, we introduce a generalized notion of inference system to support structural recursion on non-well-founded data types. Besides axioms and inference rules with the usual meaning, a generalized inference…

Logic in Computer Science · Computer Science 2018-04-23 Francesco Dagnino