English
Related papers

Related papers: Esakia's theorem for the amended monadic intuition…

200 papers

We give a new description of Pollack's plus and minus $p$-adic logarithms $\log_p^\pm$ in terms of distributions. In particular, if $\mu_\pm$ denote the pre-images of $\log_p^\pm$ under the Amice transform, we give explicit formulae for the…

Number Theory · Mathematics 2017-09-21 Cedric Dion , Antonio Lei

We study the Modular Isomorphism Problem (MIP) for groups of small order based on an improvement of an algorithm described by B. Eick. Our improvement allows to determine quotients $I(kG)/I(kG)^m$ of the augmentation ideal without first…

Group Theory · Mathematics 2021-07-07 L. Margolis , T. Moede

This work contributes to the theory of judgment aggregation by discussing a number of significant non-classical logics. After adapting the standard framework of judgment aggregation to cope with non-classical logics, we discuss in…

Logic in Computer Science · Computer Science 2017-11-13 Daniele Porello

Contemporary use of the term 'intension' derives from the traditional logical Frege-Russell's doctrine that an idea (logic formula) has both an extension and an intension. From the Montague's point of view, the meaning of an idea can be…

Logic in Computer Science · Computer Science 2011-03-04 Zoran Majkic

In this paper we enrich the orthomodular structure by adding a modal operator, following a physical motivation. A logical system is developed, obtaining algebraic completeness and completeness with respect to a Kripke-style semantic founded…

Quantum Physics · Physics 2009-12-22 G. Domenech , H. Freytes , C. de Ronde

The paper explores properties of the {\L}ukasiewicz {\mu}-calculus, or {\L}{\mu} for short, an extension of {\L}ukasiewicz logic with scalar multiplication and least and greatest fixed-point operators (for monotone formulas). We observe…

Logic in Computer Science · Computer Science 2015-10-06 Matteo Mio , Alex Simpson

We present the proof that the temporal logic of two-dimensional Minkowski spacetime is decidable, PSPACE-complete. The proof is based on a type of two-dimensional mosaic. Then we present the modification of the proof so as to work for…

Logic · Mathematics 2022-06-15 Robin Hirsch , Brett McLean

This work is a mathematician's attempt to understand intuitionistic logic. It can be read in two ways: as a research paper interspersed with lengthy digressions into rethinking of standard material; or as an elementary (but highly…

Logic · Mathematics 2017-05-02 Sergey A. Melikhov

The logic IK is the intuitionistic variant of modal logic introduced by Fischer Servi, Plotkin and Stirling, and studied by Simpson. This logic is considered a fundamental intuitionstic modal system as it corresponds, modulo the standard…

Logic in Computer Science · Computer Science 2025-05-14 Han Gao , Marianna Girlando , Nicola Olivetti

The coalgebraic approach to modal logic provides a uniform framework that captures the semantics of a large class of structurally different modal logics, including e.g. graded and probabilistic modal logics and coalition logic. In this…

Logic in Computer Science · Computer Science 2016-11-23 Corina Cirstea , Clemens Kupke , Dirk Pattinson

Fitch-style modal deduction, in which modalities are eliminated by opening a subordinate proof, and introduced by shutting one, were investigated in the 1990s as a basis for lambda calculi. We show that such calculi have good computational…

Logic in Computer Science · Computer Science 2018-01-22 Ranald Clouston

In this paper, we consider the question of correcting mock modular forms in order to obtain $p$-adic modular forms. In certain cases we show that a mock modular form $M^+$ is a $p$-adic modular form. Furthermore, we prove that otherwise the…

Number Theory · Mathematics 2010-03-31 Kathrin Bringmann , Pavel Guerzhoy , Ben Kane

Multimodal knowledge graph completion (MKGC) aims to predict missing entities in MKGs. Previous works usually share relation representation across modalities. This results in mutual interference between modalities during training, since for…

Computation and Language · Computer Science 2022-11-02 Yu Zhao , Xiangrui Cai , Yike Wu , Haiwei Zhang , Ying Zhang , Guoqing Zhao , Ning Jiang

We show that over the class of linear orders with additional binary relations satisfying some monotonicity conditions, monadic first-order logic has the three-variable property. This generalizes (and gives a new proof of) several known…

Logic in Computer Science · Computer Science 2019-04-02 Marie Fortin

The system of intuitionistic modal logic ${\bf IEL}^{-}$ was proposed by S. Artemov and T. Protopopescu as the intuitionistic version of belief logic \cite{Artemov}. We construct the modal lambda calculus which is Curry-Howard isomorphic to…

Logic · Mathematics 2020-12-08 Daniel Rogozin

In a recent paper by Ambr\'osio et al. [arXiv:2405.14799], it was shown that the gravitational force law of the Modified Newtonian Dynamics (MOND) phenomenology can be derived within the framework of entropic gravity and the holographic…

General Relativity and Quantum Cosmology · Physics 2024-06-05 Julius Lehmann

We introduce proper display calculi for intuitionistic, bi-intuitionistic and classical linear logics with exponentials, which are sound, complete, conservative, and enjoy cut-elimination and subformula property. Based on the same design,…

Logic · Mathematics 2016-11-15 Giuseppe Greco , Alessandra Palmigiano

We deal with the monadic (second-order) theory of order. We prove all known results in a unified way, show a general way of reduction, prove more results and show the limitation on extending them. We prove (CH) that the monadic theory of…

Logic · Mathematics 2023-05-02 Saharon Shelah

In previous work, I introduced a measure-conjugacy invariant for sofic group actions called sofic entropy. Here it is proven that the sofic entropy of an amenable group action equals its classical entropy. The proof uses a new…

Dynamical Systems · Mathematics 2011-03-29 Lewis Bowen

This paper studies a first-order expansion of a combination C+J of intuitionistic and classical propositional logic, which was studied by Humberstone (1979) and del Cerro and Herzig (1996), from a proof-theoretic viewpoint. While C+J has…

Logic in Computer Science · Computer Science 2022-04-15 Masanobu Toyooka , Katsuhiko Sano