Related papers: Failure of the Blok-Esakia Theorem in the monadic …
Boij-S\"oderberg theory characterizes syzygies of graded modules and sheaves on projective space. This paper continues earlier work with S. Sam, extending the theory to the setting of $GL_k$-equivariant modules and sheaves on Grassmannians.…
In this short note, we will show the following weak evidence of S. Lang conjecture over function fields. Let f : X ---> Y be a projective and surjective morphism of algebraic varieties over an algebraically closed field k of characteristic…
Theories of low-energy Lorentz violation by a fixed-norm "aether" vector field with two-derivative kinetic terms have a globally bounded Hamiltonian and are perturbatively stable only if the vector is timelike and the kinetic term in the…
We suggest an ordering for the predicates in continuous logic so that the semantics of continuous logic can be formulated as a hyperdoctrine. We show that this hyperdoctrine can be embedded into the hyperdoctrine of subobjects of a suitable…
Inspired by recent work of Aslanyan and Daw, we introduce the notion of $\Sigma$-orbits in the general framework of distinguished categories. In the setting of connected Shimura varieties, this concept contains many instances of…
This paper is a sequel to "Logical systems I: Lambda calculi through discreteness". It provides a general 2-categorical setting for extensional calculi and shows how intensional and extensional calculi can be related in logical systems. We…
We introduce proper display calculi for basic monotonic modal logic, the conditional logic CK and a number of their axiomatic extensions. These calculi are sound, complete, conservative and enjoy cut elimination and subformula property. Our…
In his seminal paper that inaugurated abstract argumentation, Dung proved that the set of complete extensions forms a complete semilattice with respect to set inclusion. In this note we demonstrate that this proof is incorrect with…
We consider the satisfiability problem for the two-variable fragment of first-order logic over finite unranked trees. We work with signatures consisting of some unary predicates and the binary navigational predicates child, right sibling,…
Logic $L$ was introduced by Lewitzka [7] as a modal system that combines intuitionistic and classical logic: $L$ is a conservative extension of CPC and it contains a copy of IPC via the embedding $\varphi\mapsto\square\varphi$. In this…
We contemplate a higher-level bipolar abstract argumentation for non-elementary arguments such as: X argues against Ys sincerity with the fact that Y has presented his argument to draw a conclusion C, by omitting other facts which would not…
In many situations humans have to reason with inconsistent knowledge. These inconsistencies may occur due to not fully reliable sources of information. In order to reason with inconsistent knowledge, it is not possible to view a set of…
Simple type theory is suited as framework for combining classical and non-classical logics. This claim is based on the observation that various prominent logics, including (quantified) multimodal logics and intuitionistic logics, can be…
It is known that the classical Banach--Stone theorem does not extend to the class of $AC(\sigma)$ spaces of absolutely continuous functions defined on compact subsets of the complex plane. On the other hand, if $\sigma$ is restricted to the…
We introduce and study a new type of compactness principle for strong logics that, roughly speaking, infers the consistency of a theory from the consistency of its small fragments in certain outer models of the set-theoretic universe. We…
This work is the first exploration of proof-theoretic semantics for a substructural logic. It focuses on the base-extension semantics (B-eS) for intuitionistic multiplicative linear logic (IMLL). The starting point is a review of…
Recently, in [DvZa], we have introduced $EMV$-algebras which resemble $MV$-algebras but the top element is not guaranteed for them. For $\sigma$-complete $EMV$-algebras, we prove an analogue of the Loomis--Sikorski Theorem showing that…
We give a new characterization of elementary and deterministic polynomial time computation in linear logic through the proofs-as-programs correspondence. Girard's seminal results, concerning elementary and light linear logic, achieve this…
The notion of a non-deterministic logical matrix (where connectives are interpreted as multi-functions) extends the traditional semantics for propositional logics based on logical matrices (where connectives are interpreted as functions).…
We investigate properties of monadic purely negational fragment of Intuitionistic Control Logic (ICL). This logic arises from Intuitionistic Propositional Logic (IPL) by extending language of IPL by additional new constant for falsum.…