Rules and arithmetics

DOI10.1305/ndjfl/1039096308zbMath0968.03071OpenAlexW2058774275MaRDI QIDQ5937848

Albert Visser

Publication date: 17 July 2001

Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1305/ndjfl/1039096308

zbMATH Keywords

Heyting arithmeticadmissible rulesconstructive arithmetical theoriesintuitionistic propositional logiclogical structure of arithmetical theories

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30) Metamathematics of constructive systems (03F50)

Related Items (13)

On rules ⋮ The basic intuitionistic logic of proofs ⋮ Tutorial on Admissible Rules in Gudauri ⋮ Lewis meets Brouwer: constructive strict implication ⋮ Intermediate logics and the de Jongh property ⋮ THE FIRST-ORDER LOGIC OF CZF IS INTUITIONISTIC FIRST-ORDER LOGIC ⋮ Realisability for infinitary intuitionistic set theory ⋮ Logics of intuitionistic Kripke-Platek set theory ⋮ Faith \& falsity ⋮ On the rules of intermediate logics ⋮ Stack-like and queue-like dynamics in recurrent neural networks ⋮ Predicate Logics of Constructive Arithmetical Theories ⋮ DECIDABILITY OF ADMISSIBILITY: ON A PROBLEM BY FRIEDMAN AND ITS SOLUTION BY RYBAKOV

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The unprovability of small inconsistency. A study of local and global interpretability
• Constructive formalization of the Tennenbaum theorem and its applications
• Self-reference and modal logic
• On the scheme of induction for bounded arithmetic formulas
• The formalization of interpretability
• Incompleteness in intuitionistic metamathematics
• Constructivism in mathematics. An introduction. Volume I
• Constructivism in mathematics. An introduction. Volume II
• On arithmetic complexity of certain constructive logics
• Modified realizability and predicate logic
• Admissibility of logical inference rules
• A minimal predicative set theory
• A course on bimodal provability logic
• Undecidable theories
• SOME VARIANTS OF THE NOTION OF REALIZABILITY FOR PREDICATE FORMULAS
• ABSOLUTE REALIZABILITY OF PREDICATE FORMULAS
• Cuts, consistency statements and interpretations
• Extension of Lifschitz' realizability to higher order arithmetic, and a solution to a problem of F. Richman
• On an interpretation of second order quantification in first order intuitionistic propositional logic
• Kripke models and the intuitionistic theory of species
• THE NONARITHMETICITY OF THE CLASS OF REALIZABLE PREDICATE FORMULAS
• Unification in intuitionistic logic
• On the completenes principle: A study of provability in heyting's arithmetic and extensions
• A sheaf representation and duality for finitely presented Heyting algebras
• Propositional Calculus and Realizability

This page was built for publication: Rules and arithmetics