English
Related papers

Related papers: Glivenko's theorems from an ecumenical perspective

200 papers

Prawitz formulated the so-called inversion principle as one of the characteristic features of Gentzen's intuitionistic natural deduction. In the literature on proof-theoretic semantics, this principle is often coupled with another that is…

Logic in Computer Science · Computer Science 2022-01-03 Alberto Naibo , Yuta Takahashi

Propositional canonical Gentzen-type systems, introduced in 2001 by Avron and Lev, are systems which in addition to the standard axioms and structural rules have only logical rules in which exactly one occurrence of a connective is…

Logic in Computer Science · Computer Science 2015-07-01 Arnon Avron , Anna Zamansky

In the first part of this paper we analyzed finite non-deterministic matrix semantics for propositional non-normal modal logics as an alternative to the standard Kripke's possible world semantics. This kind of modal systems characterized by…

Logic · Mathematics 2021-01-08 Marcelo E. Coniglio , Luis Fariñas del Cerro , Newton M. Peron

We give a proof-theoretic as well as a semantic characterization of a logic in the signature with conjunction, disjunction, negation, and the universal and existential quantifiers that we suggest has a certain fundamental status. We present…

Logic · Mathematics 2023-04-06 Wesley H. Holliday

This is a companion to a paper by the authors entitled "G\"odel's natural deduction", which presented and made comments about the natural deduction system in G\"odel's unpublished notes for the elementary logic course he gave at the…

Logic · Mathematics 2016-11-16 Milos Adzic , Kosta Dosen

Canonical inference rules and canonical systems are defined in the framework of non-strict single-conclusion sequent systems, in which the succeedents of sequents can be empty. Important properties of this framework are investigated, and a…

Logic in Computer Science · Computer Science 2015-07-01 Arnon Avron , Ori Lahav

How can we reason around logical paradoxes without falling into them? This paper introduces grounded deduction or GD, a Kripke-inspired approach to first-order logic and arithmetic that is neither classical nor intuitionistic, but…

Logic · Mathematics 2025-04-07 Bryan Ford

We study a system, called NEL, which is the mixed commutative/non-commutative linear logic BV augmented with linear logic's exponentials. Equivalently, NEL is MELL augmented with the non-commutative self-dual connective seq. In this paper,…

Logic in Computer Science · Computer Science 2022-07-01 Lutz Strassburger , Alessio Guglielmi

We explore Leibniz's understanding of the differential calculus, and argue that his methods were more coherent than is generally recognized. The foundations of the historical infinitesimal calculus of Newton and Leibniz have been a target…

History and Overview · Mathematics 2012-12-03 Mikhail G. Katz , David Sherry

Vapnik--Chervonenkis' theorem is a seminal result in machine learning. It establishes sufficient conditions for empirical probabilities to converge to theoretical probabilities, uniformly over families of events. It also provides an…

Machine Learning · Computer Science 2026-01-26 A. Iosevich , A. Vagharshakyan , E. Wyman

We provide the differential equations that generalize the Newtonian N-body problem of celestial mechanics to spaces of constant Gaussian curvature, k, for all k real. In previous studies, the equations of motion made sense only for k…

Dynamical Systems · Mathematics 2019-08-15 Florin Diacu

Wolfram's Principle of Computational Equivalence (PCE) implies that universal complexity abounds in nature. This paper comprises three sections. In the first section we consider the question why there are so many universal phenomena around.…

Logic in Computer Science · Computer Science 2012-11-09 Joost J. Joosten

We define a family of intuitionistic non-normal modal logics; they can bee seen as intuitionistic counterparts of classical ones. We first consider monomodal logics, which contain only one between Necessity and Possibility. We then consider…

Logic in Computer Science · Computer Science 2019-01-30 Tiziano Dalmonte , Charles Grellois , Nicola Olivetti

In this paper a novel calculus system has been established based on the concept of 'werden'. The basis of logic self-contraction of the theories on current calculus was shown. Mistakes and defects in the structure and meaning of the…

General Mathematics · Mathematics 2012-01-13 Xiaoping Ding

The Lambek calculus can be considered as a version of non-commutative intuitionistic linear logic. One of the interesting features of the Lambek calculus is the so-called "Lambek's restriction," that is, the antecedent of any provable…

Logic · Mathematics 2019-05-10 Max Kanovich , Stepan Kuznetsov , Andre Scedrov

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

We present a method, based on the Keldysh formalism, for deriving stochastic master equations that describe the non-Markovian dynamics of a quantum system coupled to a Gaussian environment. This approach yields a compact expression for the…

Quantum Physics · Physics 2026-01-21 Vasco Cavina , Antonio D'Abbruzzo , Vittorio Giovannetti

We give a pedagogical introduction into an old, but unfortunately not commonly known formulation of GR in terms of self-dual two-forms due to in particular Jerzy Plebanski. Our presentation is rather explicit in that we show how the…

General Relativity and Quantum Cosmology · Physics 2011-03-04 Kirill Krasnov

This paper develops stable canonical rules for intuitionistic modal logics, which were first introduced for superintuitionistic logics and transitive nor mal modal logics in [1] and [2] respectively. We first prove that every in…

Logic · Mathematics 2026-02-11 Cheng Liao

We study the notion of conservative translation between logics introduced by Feitosa and D'Ottaviano. We show that classical propositional logic (CPC) is universal in the sense that every finitary consequence relation over a countable set…

Logic · Mathematics 2012-11-29 Emil Jeřábek
‹ Prev 1 3 4 5 6 7 10 Next ›