Lewis meets Brouwer: constructive strict implication (Q1688950): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Latest revision as of 03:43, 11 December 2024

scientific article

Language	Label	Description	Also known as
English	Lewis meets Brouwer: constructive strict implication	scientific article

Statements

scholarly article

0 references

Lewis meets Brouwer: constructive strict implication (English)

0 references

0 references

0 references

Indagationes Mathematicae. New Series

0 references

publication date

12 January 2018

0 references

full work available at URL

https://arxiv.org/abs/1708.02143

0 references

describes a project that uses

0 references

MaRDI profile type

MaRDI publication profile

0 references

A Formalized Proof of Strong Normalization for Guarded Recursive Types

0 references

Computational interpretations of linear logic

0 references

Cut-free tableau calculi for some propositional normal modal logics

0 references

A very modal model of a modern, major, general type system

0 references

The \(\Sigma_1\)-provability logic of \(\mathsf{HA}\)

0 references

INTUITIONISTIC EPISTEMIC LOGIC

0 references

Productive coprogramming with guarded recursion

0 references

The deduction theorem in a functional calculus of first order based on strict implication

0 references

Strict implication, deducibility and the deduction theorem

0 references

The nonderivability in intuitionistic formal systems of theorems on the continuity of effective operations

0 references

On the limit existence principles in elementary arithmetic and \(\varSigma_{n}^{0}\)-consequences of theories

0 references

Computational types from a logical perspective

0 references

The interpretability logic of Peano arithmetic

0 references

Esakia style duality for implicative semilattices

0 references

Intensional Type Theory with Guarded Recursive Types qua Fixed Points on Universes

0 references

First steps in synthetic guarded domain theory: step-indexing in the topos of trees

0 references

A Model of Countable Nondeterminism in Guarded Type Theory

0 references

Guarded Dependent Type Theory with Coinductive Types

0 references

A model of guarded recursion with clock synchronisation

0 references

0 references

Provability: The emergence of a mathematical modality

0 references

Models for normal intuitionistic modal logics

0 references

A closer look at some subintuitionistic logics

0 references

Bounded distributive lattices with strict implication

0 references

Programming and Reasoning with Guarded Recursion for Coinductive Types

0 references

Sequent Calculus in the Topos of Trees

0 references

Weak Logics with Strict Implication

0 references

TRANSITIVE PRIMAL INFON LOGIC

0 references

0 references

Intermediate logics and the de Jongh property

0 references

0 references

The first axiomatization of relevant logic

0 references

0 references

0 references

A modification of Parry's analytic implication

0 references

Propositional lax logic

0 references

0 references

Analytic implication

0 references

MacNeille completions and canonical extensions

0 references

0 references

0 references

Grothendieck Topology as Geometric Modality

0 references

The logic of \(\Pi_ 1\)-conservativity

0 references

The Henkin Sentence

0 references

Generalising monads to arrows

0 references

0 references

Preservativity logic: An analogue of interpretability logic for constructive theories

0 references

Properties of Intuitionistic Provability and Preservativity Logics

0 references

0 references

0 references

0 references

Monad as modality

0 references

Brouwerian Semilattices

0 references

A semantic model for graphical user interfaces

0 references

Higher-order functional reactive programming in bounded space

0 references

Epistemic Updates on Algebras

0 references

A Note on Strict Implication (1935)

0 references

Idioms are Oblivious, Arrows are Meticulous, Monads are Promiscuous

0 references

Provability logic—a short introduction

0 references

0 references

Constructive Modalities with Provability Smack

0 references

Lewis meets Brouwer: constructive strict implication

0 references

Solution of a problem of Leon Henkin

0 references

Editor's Introduction to C.I. Lewis and C.H. Langford ‘A Note on Strict Implication’

0 references

Applicative programming with effects

0 references

Constructive validity is nonarithmetic

0 references

Incompleteness in intuitionistic metamathematics

0 references

Guard Your Daggers and Traces: Properties of Guarded (Co-)recursion

0 references

A type theory for productive coprogramming via guarded recursion

0 references

Notions of computation and monads

0 references

0 references

The Logic of Bunched Implications

0 references

Lifschitz' realizability

0 references

In memoriam: Clarence Irving Lewis (1883--1964)

0 references

A Survey of Propositional Realizability Logic

0 references

Intuitionistic epistemic logic, Kripke models and Fitch's paradox

0 references

The semantics and proof theory of the logic of bunched implications

0 references

Possible worlds and resources: The semantics of \(\mathbf{BI}\)

0 references

Interpolation in fragments of intuitionistic propositional logic

0 references

A Light Modality for Recursion

0 references

0 references

A smart child of Peano's

0 references

ModuRes: A Coq Library for Modular Reasoning About Concurrent Higher-Order Imperative Programming Languages

0 references

Self-reference and modal logic

0 references

Provability interpretations of modal logic

0 references

Lectures on the Curry-Howard isomorphism

0 references

0 references

Biological Perspectives Irreversible Lithium-Induced Neuropathy: Two Cases

0 references

Impredicative Concurrent Abstract Predicates

0 references

Metamathematical investigation of intuitionistic arithmetic and analysis. With contributions by C. A. Smorynski, J. I. Zucker and W. A. Howard

0 references

0 references

Constructivism in mathematics. An introduction. Volume I

0 references

On the completenes principle: A study of provability in heyting's arithmetic and extensions

0 references

0 references

0 references

Rules and arithmetics

0 references

Substitutions of \(\Sigma_1^0\)-sentences: Explorations between intuitionistic propositional logic and intuitionistic arithmetic

0 references

0 references

Predicate Logics of Constructive Arithmetical Theories

0 references

Closed Fragments of Provability Logics of Constructive Theories

0 references

0 references

On intuitionistic modal epistemic logic

0 references

0 references

0 references

Shavrukov's theorem on the subalgebras of diagonalizable algebras for theories containing \(I\Delta_ 0 + \exp\)

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

0 references

10.1016/J.INDAG.2017.10.003

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1688950

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1688950&oldid=38700358"