English
Related papers

Related papers: Topics, Non-Uniform Substitutions, and Variable Sh…

200 papers

We look at equivalence relations on the set of models of a theory -- MERs, for short -- such that the class of equivalent pairs is itself an elementary class, in a language appropriate for pairs of models. We provide many examples of…

Logic · Mathematics 2025-07-24 Michael Benedikt , Ehud Hrushovski

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

When making simultaneous decisions, our preference for the outcomes on one subset can depend on the outcomes on a disjoint subset. In referendum elections, this gives rise to the separability problem, where a voter must predict the outcome…

Combinatorics · Mathematics 2020-06-08 Andrew Beveridge , Ian Calaway

Large language models (LLMs) are increasingly used in domains where causal reasoning matters, yet it remains unclear whether their judgments reflect normative causal computation, human-like shortcuts, or brittle pattern matching. We…

Artificial Intelligence · Computer Science 2026-03-16 Hanna M. Dettki , Charley M. Wu , Bob Rehder

The purpose of this paper is to introduce justification logics based on conditional logics. We introduce a new family of logics, called conditional justification logics, which incorporates a counterfactual conditional in its language. For…

Logic · Mathematics 2025-01-17 Meghdad Ghari

Logical relations built on top of an operational semantics are one of the most successful proof methods in programming language semantics. In recent years, more and more expressive notions of operationally-based logical relations have been…

Logic in Computer Science · Computer Science 2024-08-07 Francesco Dagnino , Francesco Gavazzo

This article contributes to the debate of the meaning of relationalism and background independence, which has remained of interest in theoretical physics from Newton versus Leibniz through to foundational issues for today's leading…

General Relativity and Quantum Cosmology · Physics 2014-07-16 Edward Anderson

When we work with information from multiple sources, the formalism each employs to handle uncertainty may not be uniform. In order to be able to combine these knowledge bases of different formats, we need to first establish a common basis…

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

Recent published work has addressed the Shalqvist correspondence problem for non-distributive logics. The natural question that arises is to identify the fragment of first-order logic that corresponds to logics without distribution, lifting…

Logic · Mathematics 2024-12-23 Chrysafis , Hartonas

We introduce a family of comparative plausibility logics over neighbourhood models, generalising Lewis' comparative plausibility operator over sphere models. We provide axiom systems for the logics, and prove their soundness and…

Logic in Computer Science · Computer Science 2022-10-20 Tiziano Dalmonte , Marianna Girlando

Given a consequence relation in many-valued logic, what connectives can be defined? For instance, does there always exist a conditional operator internalizing the consequence relation, and which form should it take? In this paper, we pose…

Logic · Mathematics 2019-07-26 Emmanuel Chemla , Paul Egré

We study probabilistic team semantics which is a semantical framework allowing the study of logical and probabilistic dependencies simultaneously. We examine and classify the expressive power of logical formalisms arising by different…

Logic in Computer Science · Computer Science 2019-02-26 Miika Hannula , Åsa Hirvonen , Juha Kontinen , Vadim Kulikov , Jonni Virtema

LP$^{\supset,\mathsf{F}}$ is a three-valued paraconsistent propositional logic which is essentially the same as J3. It has most properties that have been proposed as desirable properties of a reasonable paraconsistent propositional logic.…

Logic in Computer Science · Computer Science 2021-03-08 C. A. Middelburg

Large language models (LLMs) has been widely adopted as a scalable surrogate for human evaluation, yet such judges remain imperfect and susceptible to surface-level biases. One possible reason is that these judges lack sufficient…

Computation and Language · Computer Science 2026-04-09 Minzhu Tu , Shiyu Ni , Keping Bi

Matching logic is a general formal framework for reasoning about a wide range of theories, with particular emphasis on programming language semantics. Notably, the intermediate language of the K semantics framework is an extension of…

Logic in Computer Science · Computer Science 2025-09-17 Ádám Kurucz , Péter Bereczky , Dániel Horpácsi

The article describes the structural and algorithmic relations between Cartesian trees and Lyndon Trees. This leads to a uniform presentation of the Lyndon table of a word corresponding to the Next Nearest Smaller table of a sequence of…

Data Structures and Algorithms · Computer Science 2017-12-27 Maxime Crochemore , Luis M. S. Russo

The classical decision problem, as it is understood today, is the quest for a delineation between the decidable and the undecidable parts of first-order logic based on elegant syntactic criteria. In this paper, we treat the concept of…

Logic in Computer Science · Computer Science 2019-11-27 Marco Voigt

Contextuality and nonlocality are non-classical properties exhibited by quantum statistics whose implications profoundly impact both foundations and applications of quantum theory. In this paper we provide some insights into logical…

Quantum Physics · Physics 2021-08-11 Leonardo Santos , Barbara Amaral

We analyze a few illustrative examples of scenarios in which relativistic symmetries are deformed by Planck-scale effects in particle-type-dependent manner. The novel mathematical structures required by such scenarios are the mixing…

General Relativity and Quantum Cosmology · Physics 2020-04-22 Giovanni Amelino-Camelia , Michelangelo Palmisano , Michele Ronco , Giacomo D'Amico

We give a novel approach to proving soundness and completeness for a logic (henceforth: the object-logic) that bypasses truth-in-a-model to work directly with validity. Instead of working with specific worlds in specific models, we reason…

Logic in Computer Science · Computer Science 2022-10-12 Alexander V. Gheorghiu , David J. Pym