Realist Consequence, Epistemic Inference, Computational Correctness

DOI10.1007/978-3-319-15368-1_26zbMath1376.03010OpenAlexW826240434MaRDI QIDQ5350353

Giuseppe Primiero

Publication date: 28 August 2017

Published in: Studies in Universal Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-15368-1_26

zbMATH Keywords

eventual consistencyhistory of logicphilosophy of computer science

Mathematics Subject Classification ID

General topics in the theory of computing (68Q01) Logic in the philosophy of science (03A10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On specifications, subset types and interpretation of proposition in type theory
• The lambda calculus. Its syntax and semantics. Rev. ed.
• Lectures on the Curry-Howard isomorphism
• Zur Deutung der intuitionistischen Logik
• Inhabitation of types in the simply typed lambda calculus
• An algorithm for type-checking dependent types
• Information and knowledge. A constructive type-theoretical approach
• A Double Diamond of Judgement
• A simple proof of the undecidability of inhabitation in λP
• A modal analysis of staged computation
• Proceeding in Abstraction. From Concepts to Types and the Recent Perspective on Information
• Lazy Theories of Operations and Types
• A Constructive Logic for Services and Information Flow in Computer Networks
• Turing, Computing and Communication
• Anytime, anywhere
• Programming Languages and Systems
• What constitutes the numerical diversity of mathematical objects?
• Subtyping dependent types

This page was built for publication: Realist Consequence, Epistemic Inference, Computational Correctness