English
Related papers

Related papers: Maximality in finite-valued Lukasiewicz logics def…

200 papers

The unconditional, i.e. without assuming validity of RH, sharp limit relationship (as p tends to infinity) is found between the remainder in the modified Mertens asymptotic formula for the sums of primes' reciprocals and maximal values of…

Number Theory · Mathematics 2026-03-26 Gennadiy A. Kalyabin

Canonical models are of central importance in modal logic, in particular as they witness strong completeness and hence compactness. While the canonical model construction is well understood for Kripke semantics, non-normal modal logics…

Logic in Computer Science · Computer Science 2009-02-13 Lutz Schröder , Dirk Pattinson

Large Language Models (LLMs) still struggle with complex logical reasoning. While previous works achieve remarkable improvements, their performance is highly dependent on the correctness of translating natural language (NL) problems into a…

Artificial Intelligence · Computer Science 2025-10-14 Xiangyu Wang , Haocheng Yang , Fengxiang Cheng , Fenrong Liu

In this paper, we present a new necessary and sufficient condition for which the supremum exists with respect to the logic order. Moreover, we give out a new and much simpler representation of the supremum with respect to the order, our…

Mathematical Physics · Physics 2016-09-29 Liu Weihua , Wu Junde

In this paper a conditional logic is defined and studied. This conditional logic, Deterministic Bayesian Logic, is constructed as a deterministic counterpart to the (probabilistic) Bayesian conditional. The logic is unrestricted, so that…

Logic in Computer Science · Computer Science 2011-11-09 Frederic Dambreville

We study fixpoints of operators on lattices. To this end we introduce the notion of an approximation of an operator. We order approximations by means of a precision ordering. We show that each lattice operator O has a unique most precise or…

Artificial Intelligence · Computer Science 2007-05-23 Marc Denecker , Victor W. Marek , Miroslaw Truszczynski

In a recent paper we proved that if (*)=\inf_{|z_k|=1}\max_{v=1,...,n^2-n} |\sum_{k=1}^n z_k^v|, then (*)=\sqrt{n-1} if n-1 is a prime power. We proved that a construction of Fabrykowski gives minimal systems (z_1,...,z_n) to this problem.…

Number Theory · Mathematics 2007-05-23 Johan Andersson

We present a first-order probabilistic epistemic logic, which allows combining operators of knowledge and probability within a group of possibly infinitely many agents. The proposed framework is the first order extension of the logic of…

Logic in Computer Science · Computer Science 2019-01-23 Siniša Tomović , Zoran Ognjanović , Dragan Doder

Let 2<n\leq l<m< \omega. Let L_n denote first order logic restricted to the first n variables. We show that the omitting types theorem fails dramatically for the n--variable fragments of first order logic with respect to clique guarded…

Logic · Mathematics 2015-04-24 Tarek Sayed Ahmed

We study the finite frame property of some extensions of Fitting, Marek, and Truszczy\'nski's pure logic of necessitation $\mathbf{N}$. For any natural numbers $m, n$, we introduce the logic $\mathbf{N}^+\mathbf{A}_{m, n}$ by adding the…

Logic · Mathematics 2024-06-21 Taishi Kurahashi , Yuta Sato

This paper investigates formal logics for reasoning about determinacy and independence. Propositional Dependence Logic D and Propositional Independence Logic I are recently developed logical systems, based on team semantics, that provide a…

Logic · Mathematics 2017-12-05 Valentin Goranko , Antti Kuusisto

Despite large language models' (LLMs) recent advancements, their bias and hallucination issues persist, and their ability to offer consistent preferential rankings remains underexplored. This study investigates the capacity of LLMs to…

Computation and Language · Computer Science 2024-10-14 Xiutian Zhao , Ke Wang , Wei Peng

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

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

Let $\pi_1$ be a standard representation of $\mathrm{GL}_{n+1}(F)$ and let $\pi_2$ be the smooth dual of a standard representation of $\mathrm{GL}_n(F)$. When $F$ is non-Archimedean, we prove that $\mathrm{Ext}^i_{\mathrm{GL}_n(F)}(\pi_1,…

Representation Theory · Mathematics 2023-02-09 Kei Yuen Chan

We study logics determined by matrices consisting of a De~Morgan lattice with an upward closed set of designated values, such as the logic of non-falsity preservation in a given finite Boolean algebra and Shramko's logic of non-falsity…

Logic · Mathematics 2021-12-08 Adam Přenosil

This paper is concerned with the paraconsistent first-order logic LPQ$^{\supset,\mathsf{F}}$, Priest's LPQ enriched with an implication connective and a falsity constant. A sequent-style natural deduction proof system for this logic is…

Logic in Computer Science · Computer Science 2025-09-17 C. A. Middelburg

We study different maximum principles for non-local non-linear operators with non-standard growth that arise naturally in the context of fractional Orlicz-Sobolev spaces and whose most notable representative is the fractional $g-$Laplacian:…

Analysis of PDEs · Mathematics 2021-02-26 Sandra Molina , Ariel Salort , Hernán Vivas

We establish precise regularity conditions for $L_p$-boundedness of Fourier multipliers in the group algebra of $SL_n(\mathbf{R})$. Our main result is inspired by H\"ormander-Mikhlin criterion from classical harmonic analysis, although it…

Functional Analysis · Mathematics 2021-06-03 Javier Parcet , Éric Ricard , Mikael de la Salle

We investigate infinitary wellfounded systems for linear logic with fixed points, with transfinite branching rules indexed by some closure ordinal $\alpha$ for fixed points. Our main result is that provability in the system for some…

Logic · Mathematics 2026-02-24 Anupam Das , Tikhon Pshenitsyn