Related papers: Twist-Valued Models for Three-valued Paraconsisten…

In this paper we shall consider a few variants of the motivic multiple zeta values of level two by restricting the summation indices in the definition of multiple zeta values to some fixed parity patterns. These include Hoffman's multiple…

We propose a novel algorithm to decide the language inclusion between (nondeterministic) B\"uchi automata, a PSPACE-complete problem. Our approach, like others before, leverage a notion of quasiorder to prune the search for a counterexample…

The main aim of this paper is to introduce the logics of evidence and truth LETK+ and LETF+ together with a sound, complete, and decidable six-valued deterministic semantics for them. These logics extend the logics LETK and LETF- with rules…

Classical (or Boolean) type theory is the type theory that allows the type inference $\sigma \to \bot) \to \bot => \sigma$ (the type counterpart of double-negation elimination), where $\sigma$ is any type and $\bot$ is absurdity type. This…

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…

In this article the author claims that there is a paradigm shift from ZFC to NFUM and further to NACT - due to philosophical reasons, not mathematical ones. The goal is to construct systems where every "Not-Properclass" is a set! With help…

Let $\Lambda$ be an Artin algebra. In 2014, T. Adachi, O. Iyama and I. Reiten proved that the torsion funtorially finite classes in $\mathrm{mod}\,(\Lambda)$ can be described by the $\tau$-tilting theory. The aim of this paper is to…

The forcing method is a powerful tool to prove the consistency of set-theoretic assertions relative to the consistency of the axioms of set theory. Laver's theorem and Bukovsk\'y's theorem assert that set-generic extensions of a given…

We introduce some classical complexity-theoretic techniques to Parameterized Complexity. First, we study relativization for the machine models that were used by Chen, Flum, and Grohe (2005) to characterize a number of parameterized…

It is customary to expect from a logical system that it can be algebraizable, in the sense that an algebraic companion of the deductive machinery can always be found. Since the inception of da Costa's paraconsistent calculi $C_n$, algebraic…

It is argued that 4-valued paraconsistent truth values (called here "p-bits") can serve as a conceptual, mathematical and practical foundation for highly AI-relevant forms of probabilistic logic and probabilistic programming and concept…

We describe a formalization of forcing using Boolean-valued models in the Lean 3 theorem prover, including the fundamental theorem of forcing and a deep embedding of first-order logic with a Boolean-valued soundness theorem. As an…

In this paper we revisit the hypothesis needed to define the "paracomposition" operator, an analogue to the classic pull-back operation in the low regularity setting, first introduced by S. Alinhac in [3]. More precisely we do so in two…

Boolean grammars generalize context-free rewriting by extending the possibilities when dealing with different rules for the same nonterminal symbol. By allowing not only disjunction (as in the case of usual context-free grammars), but also…

Since the introduction by Hodges, and refinement by V\"a\"an\"anen, team semantic constructions have been used to generate expressively enriched logics still conserving nice properties, such as compactness or decidability. In contrast,…

The modal logic of forcing arises when one considers a model of set theory in the context of all its forcing extensions, interpreting necessity as "in all forcing extensions" and possibility as "in some forcing extension". In this modal…

We describe an approach to classify (meromorphic) representations of a given vertex operator algebra by calculating Zhu's algebra explicitly. We demonstrate this for FKS lattice theories and subtheories corresponding to the Z_2 reflection…

In probabilistic logic entailments, even moderate size problems can yield linear constraint systems with so many variables that exact methods are impractical. This difficulty can be remedied in many cases of interest by introducing a three…

A fundamental dichotomous classification for all physical systems is according to whether they are spinless or spinful. This is especially crucial for the study of symmetry-protected topological phases, as the two classes have distinct…

We propose an abelian categorification of $\hat{Z}$-invariants for Seifert $3$-manifolds. First, we give a recursive combinatorial derivation of these $\hat{Z}$-invariants using graphs with certain hypercubic structures. Next, we consider…