English
Related papers

Related papers: Failure of the Blok-Esakia Theorem in the monadic …

200 papers

A classic result in modal logic, known as the Blok Dichotomy Theorem, states that the degree of incompleteness of a normal extension of the basic modal logic $\sf K$ is $1$ or $2^{\aleph_0}$. It is a long-standing open problem whether Blok…

Logic · Mathematics 2025-02-10 Guram Bezhanishvili , Nick Bezhanishvili , Tommaso Moraschini

In this paper we present a proof of Hartogs' extension theorem, following T. Sobieszek's paper from 2003. Hartogs' theorem provides a large class of domains where holomorphic functions have analytic continuation to larger domains, and is "a…

Complex Variables · Mathematics 2016-08-03 Aleksander Simonič

I explore the relationships between Prawitz's approach to non-monotonic proof-theoretic validity, which I call reducibility semantics, and some later proof-theoretic approaches, which I call standard base semantics and Sandqvist's base…

Logic · Mathematics 2025-06-23 Antonio Piccolomini d'Aragona

Weighted monadic second-order logic is a weighted extension of monadic second-order logic that captures exactly the behaviour of weighted automata. Its semantics is parameterized with respect to a semiring on which the values that weighted…

Logic in Computer Science · Computer Science 2021-04-30 Antonis Achilleos , Mathias Ruggaard Pedersen

We present a sequent calculus for the Grzegorczyk modal logic Grz allowing cyclic and other non-well-founded proofs and obtain the cut-elimination theorem for it by constructing a continuous cut-elimination mapping acting on these proofs.…

Logic · Mathematics 2018-04-04 Yury Savateev , Daniyar Shamkanov

The proof theory and semantics of intuitionistic modal logics have been studied by Simpson in terms of Prawitz-style labelled natural deduction systems and Kripke models. An alternative to model-theoretic semantics is provided by…

Logic · Mathematics 2025-07-10 Yll Buzoku , David. J. Pym

In the style of Lindstr\"om's theorem for classical first-order logic, this article characterizes propositional bi-intuitionistic logic as the maximal (with respect to expressive power) abstract logic satisfying a certain form of…

Logic · Mathematics 2021-04-08 Grigory Olkhovikov , Guillermo Badia

Building on a recent construction of G. Plebanek and the third named author, it is shown that a complemented subspace of a Banach lattice need not be linearly isomorphic to a Banach lattice. This solves a long-standing open question in…

Functional Analysis · Mathematics 2025-04-07 D. de Hevia , G. Martínez-Cervantes , A. Salguero-Alarcón , P. Tradacete

The paper proves PSPACE-hardness of variable-free fragments of all logics between K and wGrz.

Logic · Mathematics 2022-11-29 Irina Agadzhanian , Mikhail Rybakov

We continue work of our earlier paper (Lewitzka and Brunner: Minimally generated abstract logics, Logica Universalis 3(2), 2009), where abstract logics and particularly intuitionistic abstract logics are studied. Abstract logics can be…

Logic in Computer Science · Computer Science 2017-04-04 Andreas B. M. Brunner , Steffen Lewitzka

In this paper, we introduce a foundation for computable model theory of rational Pavelka logic (an extension of {\L}ukasiewicz logic) and continuous logic, and prove effective versions of some theorems in model theory. We show how to reduce…

Logic · Mathematics 2010-06-14 Farzad Didehvar , Kaveh Ghasemloo , Massoud Pourmahdian

Lindstr\"om theorem obviously fails as a characterization of $\mathcal{L}_{\omega \omega}^{-} $, first-order logic without identity. In this note we provide a fix: we show that $\mathcal{L}_{\omega \omega}^{-} $ is \emph{maximal} among…

Logic · Mathematics 2022-12-07 Guillermo Badia , Xavier Caicedo , Carles Noguera

In this paper we investigate the links between instantiated argumentation systems and the axioms for non-monotonic reasoning described in [9] with the aim of characterising the nature of argument based reasoning. In doing so, we consider…

Artificial Intelligence · Computer Science 2017-01-16 Zimi Li , Nir Oren , Simon Parsons

We extend the work of Bousfield and Kan on monadic resolutions of spaces to $\infty$-topoi, with applications to genuine $G$-equivariant spaces ($G$ a finite group) and motivic spaces over a perfect field. In particular, we give a proof of…

Algebraic Topology · Mathematics 2025-11-11 Tom Bachmann , Anton Engelmann , Klaus Mattis

The G\"odel translation provides an embedding of the intuitionistic logic $\mathsf{IPC}$ into the modal logic $\mathsf{Grz}$, which then embeds into the modal logic $\mathsf{GL}$ via the splitting translation. Combined with Solovay's…

Logic · Mathematics 2021-03-23 Guram Bezhanishvili , Kristina Brantley , Julia Ilin

Generalizing standard monadic second-order logic for Kripke models, we introduce monadic second-order logic interpreted over coalgebras for an arbitrary set functor. We then consider invariance under behavioral equivalence of MSO-formulas.…

Logic in Computer Science · Computer Science 2019-03-14 Sebastian Enqvist , Fatemeh Seifan , Yde Venema

Lambeks Syntactic Calculus, commonly referred to as the Lambek calculus, was innovative in many ways, notably as a precursor of linear logic. But it also showed that we could treat our grammatical framework as a logic (as opposed to a…

Computation and Language · Computer Science 2015-06-19 Richard Moot

We prove a Simons-type holonomy theorem for totally skew 1-forms with values in a Lie algebra of linear isometries. The only transitive case, for this theorem, is the full orthogonal group. We only use geometric methods and we do not use…

Differential Geometry · Mathematics 2008-11-26 Carlos Olmos , Silvio Reggiani

By adapting arguments of Annala-Hoyois-Iwasa in the log setting, we prove Poincar\'e duality for smooth projective morphisms in logarithmic motivic homotopy theory. As an application, we show that the crystalline cohomology of a log…

Algebraic Geometry · Mathematics 2026-02-17 Doosung Park

Building on the correspondence between finitely axiomatised theories in {\L}ukasieiwcz logic and rational polyhedra, we prove that the unification type of the fragment of {\L}ukasiewicz logic with $n\geq 2$ variables is nullary. This solves…

Logic · Mathematics 2025-07-23 Marco Abbadini , Luca Spada
‹ Prev 1 3 4 5 6 7 10 Next ›