Results 1 to 10 of about 2,275,839 (130)

On the concurrent computational content of intermediate logics

Theoretical Computer Science, 2020
We provide a proofs-as-concurrent-programs interpretation for a large class of intermediate logics that can be formalized by cut-free hypersequent calculi.
Agata Ciabattoni, Federico Aschieri
exaly   +2 more sources

Intermediate Logics Admitting a Structural Hypersequent Calculus

Studia Logica, 2018
We characterise the intermediate logics which admit a cut-free hypersequent calculus of the form HLJ+R\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage ...
F. Lauridsen
exaly   +2 more sources

The Skolemization of prenex formulas in intermediate logics

Indagationes Mathematicae, 2019
The skolem class of a logic consists of the formulas for which the derivability of the formula is equivalent to the derivability of its Skolemization.
Rosalie Iemhoff
exaly   +2 more sources

Integrated multi-omic atlas reveals the hierarchy of spatiotemporal regulatory networks of mouse gastrulation [PDF]

Nature Communications
Spatiotemporal coordination of cellular and molecular events is crucial for cell fate commitment during mouse gastrulation. However, the high-precision mechanisms governing the timing and spatial dynamics remain poorly understood. Here, we present a time-
Xianfa Yang, Bingbing Xie, Penglei Shen, Yingying Chen, Chunjie Li, Fengxiang Tan, Yumeng Yang, Yun Yang, Rui Song, Panpan Mi, Zhiwen Liu, Mingzhu Wen, Patrick P. L. Tam, Shengbao Suo, Naihe Jing   +14 more
doaj   +2 more sources

Nested sequents for intermediate logics: the case of Gödel-Dummett logics [PDF]

J. Appl. Non Class. Logics, 2023
We present nested sequent systems for propositional Gödel-Dummett logic and its first-order extensions with non-constant and constant domains, built atop nested calculi for intuitionistic logics.
Tim S. Lyon
semanticscholar   +1 more source

POLYHEDRAL COMPLETENESS OF INTERMEDIATE LOGICS: THE NERVE CRITERION [PDF]

Journal of Symbolic Logic (JSL), 2021
We investigate a recently devised polyhedral semantics for intermediate logics, in which formulas are interpreted in n-dimensional polyhedra. An intermediate logic is polyhedrally complete if it is complete with respect to some class of polyhedra.
Sam Adam-Day, N. Bezhanishvili, D. Gabelaia, V. Marra   +3 more
semanticscholar   +1 more source

Bi-intermediate logics of trees and co-trees [PDF]

Annals of Pure and Applied Logic, 2022
A bi-Heyting algebra validates the G\"odel-Dummett axiom $(p\to q)\vee (q\to p)$ iff the poset of its prime filters is a disjoint union of co-trees (i.e., order duals of trees).
N. Bezhanishvili, Miguel Martins, T. Moraschini   +2 more
semanticscholar   +1 more source

A Note on Gödel-Dummet Logic LC

Bulletin of the Section of Logic, 2021
Let Ao, A1, . . . , An be (possibly) distintict wffs, being an odd number equal to or greater than 1. Intuitionistic Propositional Logic IPC plus the axiom (Ao → A1)V . . .V(An-1 → An)V(An → Ao) is equivalent to Gödel-Dummett logic LC.
Gemma Robles, José M. Méndez
doaj   +1 more source

On intermediate inquisitive and dependence logics: An algebraic study [PDF]

Annals of Pure and Applied Logic, 2021
This article provides an algebraic study of intermediate inquisitive and dependence logics. While these logics are usually investigated using team semantics, here we introduce an alternative algebraic semantics and we prove it is complete for all ...
D. Quadrellaro
semanticscholar   +1 more source

Hereditarily Structurally Complete Intermediate Logics: Citkin’s Theorem Via Duality

Studia Logica: An International Journal for Symbolic Logic, 2022
A deductive system is said to be structurally complete if its admissible rules are derivable. In addition, it is called hereditarily structurally complete if all its extensions are structurally complete.
N. Bezhanishvili, T. Moraschini
semanticscholar   +1 more source