scientific article; zbMATH DE number 3870631

MaRDI QIDQ3336725zbMATH OpenFDO

Authors Ketan D. Mulmuley

Publication date 1984

zbMATH Keywords

denotational semanticsdomainsrecursive predicatescpo's

Mathematics Subject Classification ID

Complete lattices, completions (06B23) Semantics in the theory of computing (68Q55)

Recommendations

• scientific article; zbMATH DE number 3896333
• On the proof theory of the existence predicate
• Mechanizable inductive proofs for a class of \(\forall \exists\) formulas
• The machinery of consistency proofs
• Mechanizing proofs with logical relations -- Kripke-style
• scientific article; zbMATH DE number 517064
• Recursive \(\omega\)-rule for proof systems
• Provably recursive functions of constructive and relatively constructive theories
• Explicit provability and constructive semantics

Cited in

(7)

• scientific article; zbMATH DE number 4101166 (Why is no real title available?)
• Tactical theorem proving in program verification
• scientific article; zbMATH DE number 5995417 (Why is no real title available?)
• scientific article; zbMATH DE number 3896333 (Why is no real title available?)
• Fully abstract submodels of typed lambda calculi
• scientific article; zbMATH DE number 1424019 (Why is no real title available?)
• On the Symmetries of and Equivalence Test for Design Polynomials.

This page was built for publication:

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