English
Related papers

Related papers: On combinations of local theory extensions

200 papers

We extend classical methods of computational complexity to the realm of distributed computing, where they sometimes prove more effective than in their original context. Our focus is on decision problems in the LOCAL model, a setting in…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-09-08 Fabian Reiter

Pairs $\aa \subset \bb$ of local quantum field theories are studied, where $\aa$ is a chiral conformal \qft and $\bb$ is a local extension, either chiral or two-dimensional. The local correlation functions of fields from $\bb$ have an…

High Energy Physics - Theory · Physics 2015-06-26 K. -H. Rehren , Ya. S. Stanev , I. T. Todorov

We develop semantics and syntax for bicategorical type theory. Bicategorical type theory features contexts, types, terms, and directed reductions between terms. This type theory is naturally interpreted in a class of structured…

Logic in Computer Science · Computer Science 2023-10-13 Benedikt Ahrens , Paige Randall North , Niels van der Weide

Overlapping clusters are common in models of many practical data-segmentation applications. Suppose we are given $n$ elements to be clustered into $k$ possibly overlapping clusters, and an oracle that can interactively answer queries of the…

Machine Learning · Computer Science 2019-10-29 Wasim Huleihel , Arya Mazumdar , Muriel Médard , Soumyabrata Pal

In the context of continuous first-order logic, special attention is often given to theories that are somehow continuous in an 'essential' way. A common feature of such theories is that they do not interpret any infinite discrete…

Logic · Mathematics 2023-06-27 James Hanson

Adjoint logic is a general approach to combining multiple logics with different structural properties, including linear, affine, strict, and (ordinary) intuitionistic logics, where each proposition has an intrinsic mode of truth. It has…

Logic in Computer Science · Computer Science 2024-02-05 Junyoung Jang , Sophia Roshal , Frank Pfenning , Brigitte Pientka

We consider systems of rational agents who act and interact in pursuit of their individual and collective objectives. We study and formalise the reasoning of an agent, or of an external observer, about the expected choices of action of the…

Computer Science and Game Theory · Computer Science 2021-02-12 Valentin Goranko , Fengkui Ju

Random intersection graphs model networks with communities, assuming an underlying bipartite structure of groups and individuals, where these groups may overlap. Group memberships are generated through the bipartite configuration model.…

Probability · Mathematics 2026-01-14 Remco van der Hofstad , Julia Komjathy , Viktoria Vadon

The study of theory combination in Satisfiability Modulo Theories (SMT) involves various model theoretic properties (e.g., stable infiniteness, smoothness, etc.). We show that such properties can be partly captured by the natural density of…

Logic in Computer Science · Computer Science 2025-05-23 Guilherme V. Toledo , Yoni Zohar

Collaboration networks are studied as an example of growing bipartite networks. These have been previously observed to have structure such as positive correlations between nearest-neighbour degrees. However, a detailed understanding of the…

Physics and Society · Physics 2009-11-11 Matti Peltomaki , Mikko Alava

The computational abilities of theories within the generalised probabilistic theory framework has been the subject of much recent study. Such investigations aim to gain an understanding of the possible connections between physical…

Quantum Physics · Physics 2021-08-27 Ciarán M. Gilligan-Lee

Default logic encounters some conceptual difficulties in representing common sense reasoning tasks. We argue that we should not try to formulate modular default rules that are presumed to work in all or most circumstances. We need to take…

Artificial Intelligence · Computer Science 2013-02-08 Choh Man Teng

We show that if a nontrivial group admits a locally invariant ordering, then it admits uncountably many locally invariant orderings. For the case of a left-orderable group, we provide an explicit construction of uncountable families of…

Group Theory · Mathematics 2022-08-03 Idrissa Ba , Adam Clay , Ian Thompson

We study the structure of families of theories in the language of arithmetic extended to allow these families to refer to one another and to themselves. If a theory contains schemata expressing its own truth and expressing a specific Turing…

Logic · Mathematics 2020-08-27 Samuel Allen Alexander

We investigate the decidability of the definability problem for fragments of first order logic over finite words enriched with modular predicates. Our approach aims toward the most generic statements that we could achieve, which…

Logic in Computer Science · Computer Science 2015-11-16 Luc Dartois , Charles Paperman

First we develop the theory of local rules for coboundary categories. Then we describe the local rules in two main cases. First for the quantum groups in general and in the seminormal representations of the Hecke algebras. Then for crystals…

Representation Theory · Mathematics 2018-05-10 Bruce W. Westbury

We introduce an idea for generalization of a local cohomology module, which we call a local cohomology module with respect to a pair of ideals (I,J), and study their various properties. Some vanishing and nonvanishing theorems are given for…

Commutative Algebra · Mathematics 2008-08-01 Ryo Takahashi , Yuji Yoshino , Takeshi Yoshizawa

The arising of central extensions is discussed in two contexts. At first classical counterparts of quantum anomalies (deserving being named as "classical anomalies") are associated with a peculiar subclass of the non-equivariant maps.…

High Energy Physics - Theory · Physics 2009-11-10 Francesco Toppan

For every class $\mathscr{C}$ of word languages, one may associate a decision problem called $\mathscr{C}$-separation. Given two regular languages, it asks whether there exists a third language in $\mathscr{C}$ containing the first…

Logic in Computer Science · Computer Science 2023-06-22 Thomas Place , Varun Ramanathan , Pascal Weil

We introduce a logical foundation to reason on tree structures with constraints on the number of node occurrences. Related formalisms are limited to express occurrence constraints on particular tree regions, as for instance the children of…

Logic in Computer Science · Computer Science 2015-07-01 Everardo Bárcenas , Jesús Lavalle
‹ Prev 1 4 5 6 7 8 10 Next ›