scientific article; zbMATH DE number 194975
From MaRDI portal
Publication:4692942
zbMath0734.68002MaRDI QIDQ4692942
Publication date: 5 June 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Church's thesiscomputational complexitysemantics of programming languagesdecidable and undecidable problemsnondeterminism and concurrencyproving program properties
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (16)
Basic logic: reflection, symmetry, visibility ⋮ The cost of a cycle is a square ⋮ The Logic of Bunched Implications ⋮ Every polynomial-time 1-degree collapses if and only if P = PSPACE ⋮ Petri nets for the design and operation of manufacturing systems ⋮ Solutions of equations in languages ⋮ A modal view of linear logic ⋮ Monoid based semantics for linear formulas ⋮ Communication-efficient proactive secret sharing for dynamic groups with dishonest majorities ⋮ Proofs of strong normalisation for second order classical natural deduction ⋮ COMPUTATIONAL FEATURES OF AGENT-BASED MODELS ⋮ Which structural rules admit cut elimination? An algebraic criterion ⋮ A filter lambda model and the completeness of type assignment ⋮ On Computable Numbers, Nonuniversality, and the Genuine Power of Parallelism ⋮ Completeness of MLL proof-nets w.r.t. weak distributivity ⋮ Monoid based semantics for linear formulas (corrected republication)
This page was built for publication:
