Related papers: Failure of the Blok-Esakia Theorem in the monadic …
We prove that the tangent complex of K-theory, in terms of (abelian) deformation problems over a characteristic 0 field k, is cyclic homology (over k). This equivalence is compatible with the $\lambda$-operations. In particular, the…
Doubts are raised concerning the usual interpretation of the alleged failure, by quantum mechanics, of the distributive law of classical logic. The difficulty raised by incompatible sets of observables is overcome within an epistemic…
Inconsistency handling is an important issue in knowledge management. Especially in ontology engineering, logical inconsistencies may occur during ontology construction. A natural way to reason with an inconsistent ontology is to utilize…
We formulate a general, signature-independent form of the law of the excluded middle and prove that a logic is semisimple if and only if it enjoys this law, provided that it satisfies a weak form of the so-called inconsistency lemma of…
We use variants of the $\mathbb{G}_0$ dichotomy to establish a refinement of Solecki's basis theorem for the family of Baire-class one functions which are not $\sigma$-continuous with closed witnesses.
The notion of non-deterministic logical matrix (where connectives are interpreted as multi-functions) preserves many good properties of traditional semantics based on logical matrices (where connectives are interpreted as functions) whilst…
In the present article, we extend the fragment of inductive formulas for the hybrid language L(@) in [8] including a McKinsey-like formula, and show that every formula in the extended class has a first-order correspondent, by modifying the…
In this paper we analyze the propositional extensions of the minimal classical modal logic system E, which form a lattice denoted as CExtE. Our method of analysis uses algebraic calculations with canonical forms, which are a generalization…
We prove that the positive fragment of first-order intuitionistic logic in the language with two variables and a single monadic predicate letter, without constants and equality, is undecidable. This holds true regardless of whether we…
Consider a Hamiltonian action of a compact Lie group on a symplectic manifold which has the strong Lefschetz property. We establish an equivariant version of the Merkulov-Guillemin $d\delta$-lemma and an improved version of the…
On an arbitrary toric variety, we introduce the logarithmic double complex, which is essentially the same as the algebraic de Rham complex in the nonsingular case, but which behaves much better in the singular case. Over the field of…
The classical view of epistemic logic is that an agent knows all the logical consequences of their knowledge base. This assumption of logical omniscience is often unrealistic and makes reasoning computationally intractable. One approach to…
Logics with team semantics provide alternative means for logical characterization of complexity classes. Both dependence and independence logic are known to capture non-deterministic polynomial time, and the frontiers of tractability in…
We outline an intuitionistic view of knowledge which maintains the original Brou\-wer-Heyting-Kolmogorov semantics for intuitionism and is consistent with the well-known approach that intuitionistic knowledge be regarded as the result of…
Continuing [Fuchino, Ottenbreit and Sakai[9, 10]] and [Fuchino and Ottenbreit[11]], we further study reflection principles in connection with the L\"owenheim-Skolem Theorems of stationary logics. In this paper, we mainly analyze the…
The celebrated Trakhtenbrot's theorem states that the set of finitely valid sentences of first-order logic is not computably enumerable. In this note we will extend this theorem by proving that the finite satisfiability problem of any…
The Szego-Widom theorem provides an expression for the determinant of block Toeplitz matrices in the asymptotic limit of large matrix dimension n. We show that the presence of zero modes, i.e, eigenvalues that vanish as \alpha^n,…
The canonical analysis of Proca's theory in five dimensions with a compact dimension is performed. From the Proca five dimensional action, we perform the compactification process on a S^1/\mathbf{Z_2} orbifold, then, we analyze the four…
We introduce a semantics for epistemic logic exploiting a belief base abstraction. Differently from existing Kripke-style semantics for epistemic logic in which the notions of possible world and epistemic alternative are primitive, in the…
The compactness theorem for a logic states, roughly, that the satisfiability of a set of well-formed formulas can be determined from the satisfiability of its finite subsets, and vice versa. Usually, proofs of this theorem depend on the…