Monotone recursive definition of predicates and its realizability interpretation

DOI10.1007/3-540-54415-1_40MaRDI QIDQ5096211zbMATH OpenOpenAlexFDO

Authors Makoto Tatsuta

Publication date 16 August 2022

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-54415-1_40

Mathematics Subject Classification ID

Logic in computer science (03B70) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• TWO REALIZABILITY INTERPRETATIONS OF MONOTONE INDUCTIVE DEFINITIONS
• Determinacy and monotone inductive definitions
• On monadic theories of monadic predicates
• Monotone Relations, Fixed Points and Recursive Definitions
• Monotone inductive definitions in explicit mathematics
• Monotone inductive definitions in a constructive theory of functions and classes
• scientific article; zbMATH DE number 2079027
• scientific article; zbMATH DE number 2144731
• The monotone completeness theorem in constructive reverse mathematics

Cites work

• scientific article; zbMATH DE number 3900744 (Why is no real title available?)
• scientific article; zbMATH DE number 3687373 (Why is no real title available?)
• Inductively defined types in the Calculus of Constructions
• Program synthesis using realizability
• Realizability interpretation of generalized inductive definitions

Cited in

(4)

• Realizability interpretation of coinductive definitions and program synthesis with streams
• Realizability interpretation of generalized inductive definitions
• TWO REALIZABILITY INTERPRETATIONS OF MONOTONE INDUCTIVE DEFINITIONS
• A TYPE-FREE THEORY OF HALF-MONOTONE INDUCTIVE DEFINITIONS

This page was built for publication: Monotone recursive definition of predicates and its realizability interpretation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5096211)