Algorithmic properties of structures

DOI10.1007/BF01705528zbMath0202.00802MaRDI QIDQ5600863

Erwin Engeler

Publication date: 1967

Published in: Mathematical Systems Theory (Search for Journal in Brave)

Related Items (31)

Stratified least fixpoint logic ⋮ Hilbert's error? ⋮ Program-substitution and admissibility of rules in algorithmic logic ⋮ Aristotle’s Relations: An Interpretation in Combinatory Logic ⋮ \(\mathbf P =\mathbf{NP}\) for some structures over the binary words ⋮ Zur Theorie Algorithmisch Abgeschlossener Modellklassen ⋮ Proving the correctness of regular deterministic programs: A unifying survey using dynamic logic ⋮ Contribution of Warsaw logicians to computational logic ⋮ Computable queries for relational data bases ⋮ Unnamed Item ⋮ Algorithmic logic. Multiple-valued extensions ⋮ A survey of state vectors ⋮ Definability by programs in first-order structures ⋮ Étude et implémentation d'un système de déduction pour logique algorithmique ⋮ Axiomatizing geometric constructions ⋮ The axiomatics of ordered geometry: I. Ordered incidence spaces ⋮ A contraction-free and cut-free sequent calculus for propositional dynamic logic ⋮ Computable total functions on metric algebras, universal algebraic specifications and dynamical systems ⋮ Function iteration logics and flowchart schemata ⋮ From Philosophical to Industrial Logics ⋮ From Monadic Logic to PSL ⋮ Regular expressions and the equivalence of programs ⋮ Zur Einbettungsbedingung im Zusammenhang mit einer Programmiersprache von Engeler ⋮ A note on the embedding property ⋮ Algorithmic approximations ⋮ On approximate and algebraic computability over the real numbers ⋮ Computation by `While' programs on topological partial algebras ⋮ Process logic with regular formulas ⋮ Necessary and sufficient conditions for the universality of programming formalisms ⋮ Equivalences among logics of programs ⋮ Some thoughts on computational models: from massive human computing to abstract state machines, and beyond

Cites Work

• Unnamed Item
• Unnamed Item
• Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
• Some definitional suggestions for automata theory
• CONSTRUCTIVE ALGEBRAS I
• Computable Algebra, General Theory and Theory of Computable Fields
• Computability of Recursive Functions

This page was built for publication: Algorithmic properties of structures