Related papers: Maximality in finite-valued Lukasiewicz logics def…
Classically, two propositions are logically equivalent precisely when they are true under the same logical valuations. Also, two logical valuations are distinct if, and only if, there is a formula that is true according to one valuation,…
The paper explores properties of the {\L}ukasiewicz {\mu}-calculus, or {\L}{\mu} for short, an extension of {\L}ukasiewicz logic with scalar multiplication and least and greatest fixed-point operators (for monotone formulas). We observe…
Let $n$-Medvedev's logic $\mathbf{ML}_n$ be the intuitionistic logic of Medvedev frames based on the non-empty subsets of a set of size $n$, which we call $n$-Medvedev frames. While these are tabular logics, after characterizing…
Ordered logics and type systems have been used in a variety of applications including computational linguistics, memory allocation, stream processing, logical frameworks, parametricity, and enforcing security protocols. In most…
Given a compatible system of n-dimension l-adic Galois representations arising from \'etale cohomology of any complete, non-singular variety, we prove that for sufficiently large prime l, type A Galois image (in the Cartan-Killing…
Justification Logics provide a framework for reasoning about justifications and evidences. Most of the accounts of justification logics are crisp in the sense that agent's justifications for a statement is convincing or is not. In this…
Schenck and Seceleanu proved that if $R = k[x,y,z]$, where $k$ is an infinite field, and $I$ is an ideal generated by any collection of powers of linear forms, then multiplication by a general linear form $L$ induces a homomorphism of…
In this paper a conditional logic is defined and studied. This conditional logic, DmBL, is constructed as a deterministic counterpart to the Bayesian conditional. The logic is unrestricted, so that any logical operations are allowed. A…
We analyze the computational complexity of admissibility and unifiability with parameters in transitive modal logics. The class of cluster-extensible (clx) logics was introduced in the first part of this series of papers. We completely…
The Lefschetz question asks if multiplication by a power of a general linear form, $L$, on a graded algebra has maximal rank (in every degree). We consider a quotient by an ideal that is generated by powers of linear forms. Then the…
For each $n\in\mathbb{N}$, let $[n]\phi$ mean "the sentence $\phi$ is true in all $\Sigma_{n+1}$-correct transitive sets." Assuming G\"odel's axiom $V = L$, we prove the following graded variant of Solovay's completeness theorem: the set of…
We show that, contrary to the commonly held view, there is a natural and optimal compactness theorem for $\mathrm{L}_{\infty\infty}$ which generalizes the usual compactness theorem for first order logic. The key to this result is the switch…
We study complex projective varieties that parametrize (finite-dimensional) filiform Lie algebras over C, using equations derived by Millionshchikov. In the infinite-dimensional case we concentrate our attention on N-graded Lie algebras of…
In 1929 Jan Lukasiewicz used, apparently for the first time, his Polish notation to represent the operations of formal logic. This is a parenthesis-free notation, which also implies that logical functions are operators preceding the…
Let L be some extension of classical propositional logic. The non-iterated probabilistic logic over L, is the logic PL that is defined by adding non-nested probabilistic operators in the language of L. For example in PL we can express a…
In this paper we maximize a class of functionals under certain constraints. We find sufficient and necessary conditions for these maximizers to exist and be unique. Moreover, we characterize them and discuss the optimality of our results by…
We study a real valued propositional logic with unbounded positive and negative truth values that we call R-valued logic. Such logic slightly extends continuous propositional logic which, in turn, builds on Lukasiewicz many-valued logic.…
We consider first-order logic with monoidal quantifiers over words. We show that all languages with a neutral letter, definable using the addition numerical predicate are also definable with the order predicate as the only numerical…
Theorem: There is a {\em complete sentence} $\phi$ of $L_{\omega_1,\omega}$ such that $\phi$ has maximal models in a set of cardinals $\lambda$ that is cofinal in the first measurable $\mu$ while $\phi$ has no maximal models in any $\chi…
Large language models (LLMs) have achieved remarkable performance on a variety of natural language understanding tasks. However, existing benchmarks are inadequate in measuring the complex logical reasoning capabilities of a model. We…