English
Related papers

Related papers: Logic Blog 2016

200 papers

This paper aims to systematically study mystic reflection groups that emerged independently in the paper [Selecta Math. (N.S.) 14 (2009), 325-372, arXiv:0806.0867] by the authors and in the paper [Algebr. Represent. Theory 13 (2010),…

Representation Theory · Mathematics 2014-04-07 Yuri Bazlov , Arkady Berenstein

We stratify intuitionistic first-order logic over $(\forall,\to)$ into fragments determined by the alternation of positive and negative occurrences of quantifiers (Mints hierarchy). We study the decidability and complexity of these…

Logic in Computer Science · Computer Science 2019-03-14 Aleksy Schubert , Paweł Urzyczyn , Konrad Zdanowski

In this note, we classify all finite groups having exactly 6, 7 or 8 cyclic subgroups. This gives a partial answer to the open problem posed by Tarnauceanu (Amer. Math. Monthly, 122 (2015), 275-276). As a consequence of our results, we also…

Group Theory · Mathematics 2018-05-08 Hemant Kalra

Logics closed under classes of substitutions broader than class of uniform substitutions are known as hyperformal logics. This paper extends known results about hyperformal logics in two ways. First: we examine a very powerful form of…

Logic · Mathematics 2026-04-28 Shay Allen Logan , Blane Worley

Program logics for bug-finding (such as the recently introduced Incorrectness Logic) have framed correctness and incorrectness as dual concepts requiring different logical foundations. In this paper, we argue that a single unified theory…

Logic in Computer Science · Computer Science 2023-03-14 Noam Zilberstein , Derek Dreyer , Alexandra Silva

We extend the epistemic logic with De Morgan negation by Fagin et al. (Artif. Intell. 79, 203-240, 1995) by adding operators for universal and common knowledge in a group of agents, and with a formalization of information update using a…

Logic in Computer Science · Computer Science 2019-09-26 Igor Sedlár , Vít Punčochář , Andrew Tedder

We construct a De Morgan algebra-valued logic with quantifiers, where the truth values are in a finite De Morgan algebra, We show that there is a representation theorem of the cylindric algebra of this logic from which a completeness…

Logic · Mathematics 2014-09-02 Norman Feldman

One of the main claims of the paper is that Dirac's calculus and broader theories of physics can be treated as theories written in the language of Continuous Logic. Establishing its true interpretation (model) is a model theory problem. The…

Logic · Mathematics 2024-10-04 Boris Zilber

A celebrated conjecture due to De Giorgi states that any bounded solution of the equation $\Delta u + (1-u^2) u = 0 \hbox{in} \R^N $ with $\pp_{y_N}u >0$ must be such that its level sets $\{u=\la\}$ are all hyperplanes, {\em \bf at least}…

Analysis of PDEs · Mathematics 2009-03-27 Manuel del Pino , Mike Kowalczyk , Juncheng Wei

We extend the inflationary fixed-point logic, IFP, with a new kind of second-order quantifiers which have (poly-)logarithmic bounds. We prove that on ordered structures the new logic $\exists^{\log^{\omega}}\text{IFP}$ captures the limited…

Logic in Computer Science · Computer Science 2022-09-07 Kexu Wang , Xishun Zhao

Mathematicians had little idea whether the easy-to-state union-closed conjecture was true or false even after $40$ years. However, last winter saw a surge of interest in the conjecture and its variants, initiated by the contribution of a…

Combinatorics · Mathematics 2023-06-22 Stijn Cambie

This paper discusses the semantics and proof theory of Nilsson's probabilistic logic, outlining both the benefits of its well-defined model theory and the drawbacks of its proof theory. Within Nilsson's semantic framework, we derive a set…

Artificial Intelligence · Computer Science 2013-04-11 Peter Haddawy , Alan M. Frisch

Large language models (LLMs) have achieved remarkable successes on various tasks. However, recent studies have found that there are still significant challenges to the logical reasoning abilities of LLMs, which can be categorized into the…

Artificial Intelligence · Computer Science 2025-07-22 Fengxiang Cheng , Haoxuan Li , Fenrong Liu , Robert van Rooij , Kun Zhang , Zhouchen Lin

The implication relationship between subsystems in Reverse Mathematics has an underlying logic, which can be used to deduce certain new Reverse Mathematics results from existing ones in a routine way. We use techniques of modal logic to…

Logic · Mathematics 2015-04-21 Carl Mummert , Alaeddine Saadaoui , Sean Sovine

We prove that the problem of deciding the consequence relation of the full Lambek calculus with weakening is complete for the class HAck of hyper-Ackermannian problems (i.e., level F_{\omega}^{\omega} of the ordinal-indexed hierarchy of…

Logic in Computer Science · Computer Science 2024-06-25 Vitor Greati , Revantha Ramanayake

We present a propositional logic to reason about the uncertainty of events, where the uncertainty is modeled by a set of probability measures assigning an interval of probability to each event. We give a sound and complete axiomatization…

Artificial Intelligence · Computer Science 2014-08-08 Joseph Y. Halpern , Riccardo Pucella

We present a propositional logic %which can be used to reason about the uncertainty of events, where the uncertainty is modeled by a set of probability measures assigning an interval of probability to each event. We give a sound and…

Artificial Intelligence · Computer Science 2007-05-23 Joseph Y. Halpern , Riccardo Pucella

We prove upper and lower bounds on the effective content and logical strength for a variety of natural restrictions of Hindman's Finite Sums Theorem. For example, we show that Hindman's Theorem for sums of length at most 2 and 4 colors…

In this paper we study the spectrum $\Sigma$ of the infinite Feinberg-Zee random hopping matrix, a tridiagonal matrix with zeros on the main diagonal and random $\pm 1$'s on the first sub- and super-diagonals; the study of this…

Spectral Theory · Mathematics 2016-11-29 Simon N. Chandler-Wilde , Raffael Hagger

In this work we continue the syntactic study of completeness that began with the works of Immerman and Medina. In particular, we take a conjecture raised by Medina in his dissertation that says if a conjunction of a second-order and a…

Logic in Computer Science · Computer Science 2015-07-01 Nerio Borges , Blai Bonet