scientific article; zbMATH DE number 3322506
From MaRDI portal
Publication:5601829
zbMath0203.16402MaRDI QIDQ5601829
Publication date: 1963
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Logic in computer science (03B70) Applications of computability and recursion theory (03D80) Computer science (68-XX)
Related Items (88)
A Gentzen system for conditional logic ⋮ Relational algebraic semantics of deterministic and nondeterministic programs ⋮ A domain-theoretic model of nominally-typed object-oriented programming ⋮ A theory for nondeterminism, parallelism, communication, and concurrency ⋮ The origins of structural operational semantics ⋮ On merging software extensions ⋮ Identification of biological transition systems using meta-interpreted logic programs ⋮ Introduction to Model Checking ⋮ Combining Model Checking and Deduction ⋮ Equivalences and transformations of regular systems - applications to recursive program schemes and grammars ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Correspondence analysis and automated proof-searching for first degree entailment ⋮ A computational interpretation of conceptivism ⋮ \(\mathbb{T}^\omega\) as a universal domain ⋮ Computation on graph-like expressions ⋮ Optimal evaluations of graph-like expressions ⋮ Specification and verification of concurrent systems by causality and realizability ⋮ Prolegomena to a theory of mechanized formal reasoning ⋮ On the algebra of order ⋮ On primitive recursive algorithms and the greatest common divisor function ⋮ Varieties of chain-complete algebras ⋮ Smart Choices and the Selection Monad ⋮ On building cyclic and shared structures in Haskell ⋮ Inversive meadows and divisive meadows ⋮ Extracting total Amb programs from proofs ⋮ Equations for if-then-else ⋮ Nondeterministic flowchart programs with recursive procedures: Semantics and correctness. II ⋮ Recursive data structures ⋮ Reasoning about multi-stage programs ⋮ An independent axiomatisation for free short-circuit logic ⋮ A first order logic for partial functions ⋮ Unnamed Item ⋮ Programs as partial graphs. I: Flow equivalence and correctness ⋮ Abstract data types and algebraic semantics of programming languages ⋮ Efficient Well-Definedness Checking ⋮ Variations on the Collapsing Lemma ⋮ A map of dependencies among three-valued logics ⋮ Belnap's logic and conditional composition ⋮ On three-valued presentations of classical logic ⋮ Map theory ⋮ Computational interpretations of linear logic ⋮ Adas and the equational theory of if-then-else ⋮ External and internal syntax of the \(\lambda \)-calculus ⋮ On the representation of McCarthy's \(amb\) in the \(\pi\)-calculus ⋮ Monoids with tests and the algebra of possibly non-halting programs ⋮ A \(\kappa\)-denotational semantics for map theory in ZFC+SI ⋮ Semantical analysis of weak Kleene logics ⋮ A calculus for four-valued sequential logic ⋮ Computer theorem proving in mathematics ⋮ Infinite trees in normal form and recursive equations having a unique solution ⋮ A formal system of partial recursive functions ⋮ Program equivalence and context-free grammars ⋮ A glimpse into the paradise of combinatory algebra ⋮ Comparison semigroups and algebras of transformations. ⋮ Language design methods based on semantic principles ⋮ A brief history of process algebra ⋮ Least fixed points revisited ⋮ A theorem prover for a computational logic ⋮ A Uniform Formalisation of Three-Valued Logics in Bisequent Calculus ⋮ Relationships between classes of monotonic functions ⋮ Milestones from the Pure Lisp Theorem Prover to ACL2 ⋮ IO and OI. I ⋮ A canonical form algorithm for proving equivalence of conditional forms ⋮ IO and OI. II ⋮ Towards systematic treatment of partial functions in knowledge representation ⋮ Schematic program proofs with abstract execution. Theory and applications ⋮ Normalisation for some infectious logics and their relatives ⋮ Monadic recursion schemes: The effect of constants ⋮ Algebraic properties of if-then-else and commutative three-valued tests ⋮ Missing values and dragonfly operations in fuzzy relational compositions ⋮ Regular expressions and the equivalence of programs ⋮ On the structure of \(C\)-algebras through atomicity and \texttt{if-then-else} ⋮ Recursively unsolvable word problems of modular lattices and diagram- chasing ⋮ Algebraic specification of data types: A synthetic approach ⋮ On formalised computer programs ⋮ A fully abstract semantics for concurrent constraint programming ⋮ Mathematical theory of partial correctness ⋮ Interaction Nets with McCarthy's amb ⋮ Computation by `While' programs on topological partial algebras ⋮ Recursion induction principle revisited ⋮ Nondeterministic three-valued logic: isotonic and guarded truth-functions ⋮ Observational program calculi and the correctness of translations ⋮ Non-commutative propositional logic with short-circuit evaluation ⋮ A Generalization of ACP Using Belnap's Logic ⋮ Process algebra and conditional composition ⋮ Axiomatization of if-then-else over possibly non-halting programs and tests
This page was built for publication:
