On the public citation graph

Necessary and sufficient conditions for the universality of programming formalisms

https://doi.org/10.1007/bf00288773
0 signed · 52 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-09237-4openalex-snapshot
First-Order Dynamic Logic
inferredcites →https://doi.org/10.1007/3-540-12689-9_130openalex-snapshot
Deterministic context-free dynamic logic is more expressive than deterministic dynamic logic of regular programs
inferredcites →https://doi.org/10.1007/3-540-12896-4_360openalex-snapshot
Characterization of acceptable by algol-like programming languages
inferredcites →https://doi.org/10.1007/bf01705528openalex-snapshot
Algorithmic properties of structures
inferredcites →https://doi.org/10.1007/bf01744295openalex-snapshot
Relative complexity of operations on numeric and bit-string algebras
inferredcites →https://doi.org/10.1007/bf01752396openalex-snapshot
Relative complexity of algebras
inferredcites →https://doi.org/10.1007/bf01776573openalex-snapshot
A difference in expressive power between flowcharts and recursion schemes
inferredcites →https://doi.org/10.1007/bf02483111openalex-snapshot
Classification of algebraic structures by work space
inferredcites →https://doi.org/10.1016/0022-0000(83)90008-9openalex-snapshot
A view of computability on term algebras
inferredcites →https://doi.org/10.1016/0304-3975(83)90013-0openalex-snapshot
Definability by programs in first-order structures
inferredcites →https://doi.org/10.1016/s0019-9958(78)90296-6openalex-snapshot
Interpolation theorems for program schemata
inferredcites →https://doi.org/10.1016/s0019-9958(81)90163-7openalex-snapshot
The unwind property in certain algebras
inferredcites →https://doi.org/10.1016/s0019-9958(83)80006-0openalex-snapshot
A necessary and sufficient condition in order that a Herbrand interpretation be expressive relative to recursive programs
inferredcites →https://doi.org/10.1016/s0019-9958(83)80053-9openalex-snapshot
Termination assertions for recursive programs: Completeness and axiomatic definability
inferredcites →https://doi.org/10.1016/s0019-9958(83)80057-6openalex-snapshot
Nontrivial definability by flow-chart programs
inferredcites →https://doi.org/10.1016/s0022-0000(70)80022-8openalex-snapshot
On formalised computer programs
inferredcites →https://doi.org/10.1016/s0022-0000(73)80040-6openalex-snapshot
Program schemes, recursion schemes, and formal languages
inferredcites →https://doi.org/10.1016/s0022-0000(74)80030-9openalex-snapshot
Translatability of schemas over restricted interpretations
inferredcites →https://doi.org/10.1016/s0049-237x(08)71238-2openalex-snapshot
Algorithmic Procedures, Generalized Turing Algorithms, and Elementary Recursion Theory
inferredcites →https://doi.org/10.1016/s0049-237x(08)71963-3openalex-snapshot
Computation Over Abstract Structures: Serial and Parallel Procedures and Friedman's Effective Definitional Schemes
inferredcites →https://doi.org/10.1016/s0304-3975(81)80002-3openalex-snapshot
Generalized Galois theory and its application to complexity
inferredcites →https://doi.org/10.1017/cbo9780511629181.009openalex-snapshot
Computing in Algebraic Systems
inferredcites →https://doi.org/10.1109/sfcs.1977.1openalex-snapshot
A necessary and sufficient condition for the existence of hoare logics
inferredcites →https://doi.org/10.1137/0201006openalex-snapshot
On Classes of Program Schemata
inferredcites →https://doi.org/10.1137/0201017openalex-snapshot
Program Schemes with Pushdown Stores
inferredcites →https://doi.org/10.1145/1344551.1344563openalex-snapshot
Comparative schematology
inferredcites →https://doi.org/10.1145/322307.322324openalex-snapshot
Axiomatic Definitions of Programming Languages
inferredcites →https://doi.org/10.1145/800141.804646openalex-snapshot
Definability in Dynamic Logic
inferredcites →https://doi.org/10.2307/2313471openalex-snapshot
Computation: Finite and Infinite Machines.
inferredcites →https://doi.org/10.3233/fi-1977-1113openalex-snapshot
Programmability in fields

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/malq.19980440102openalex-snapshot
Computability of String Functions Over Algebraic Structures Armin Hemmerling
inferred← citeshttps://doi.org/10.1007/3-540-18170-9_181openalex-snapshot
First steps towards a theory of complexity over more general data structures
inferred← citeshttps://doi.org/10.1007/3-540-45575-2_45openalex-snapshot
Abstract Computability of Non-deterministic Programs over Various Data Structures
inferred← citeshttps://doi.org/10.1007/3-540-52753-2_30openalex-snapshot
On the verification of modules
inferred← citeshttps://doi.org/10.1007/3-540-54967-6_64openalex-snapshot
Correctness of programs over poor signatures
inferred← citeshttps://doi.org/10.1007/3-540-56287-7_109openalex-snapshot
Verification of large software systems
inferred← citeshttps://doi.org/10.1007/bf01069523openalex-snapshot
Composition aspects of programmology. II
inferred← citeshttps://doi.org/10.1007/bf01074922openalex-snapshot
Composition aspects of programmology. I
inferred← citeshttps://doi.org/10.1007/bf01221100openalex-snapshot
The verification of modules
inferred← citeshttps://doi.org/10.1007/bfb0017155openalex-snapshot
On the expressive strength of the finitely typed lambda — terms
inferred← citeshttps://doi.org/10.1007/bfb0017156openalex-snapshot
Hoare calculi for higher — type control siructures and their completeness in the sense of cook
inferred← citeshttps://doi.org/10.1007/bfb0026297openalex-snapshot
Characterizing complexity classes by general recursive definitions in higher types
inferred← citeshttps://doi.org/10.1007/s002240010018openalex-snapshot
The Universality of Higher-Order Attributed Tree Transducers
inferred← citeshttps://doi.org/10.1016/0020-0190(85)90090-0openalex-snapshot
The unwind property for programs with bounded memory
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90210-7openalex-snapshot
On the expressive power of finitely typed and universally polymorphic recursive procedures
inferred← citeshttps://doi.org/10.1016/0890-5401(92)90062-kopenalex-snapshot
Characterizing complexity classes by general recursive definitions in higher types
inferred← citeshttps://doi.org/10.1016/b978-0-444-88074-1.50020-2openalex-snapshot
Methods and Logics for Proving Programs
inferred← citeshttps://doi.org/10.1016/s0049-237x(09)70165-xopenalex-snapshot
The Pebble Game and Logics of Programs
inferred← citeshttps://doi.org/10.1070/rm1996v051n04abeh002966openalex-snapshot
Program algebras of recursive functions
inferred← citeshttps://doi.org/10.3233/fi-1994-2145openalex-snapshot
EXPRESSIBILITY OF THE SEMANTICS OF SEQUENTIAL PROGRAMS IN FIRST-ORDER LOGIC
inferred← citeshttps://doi.org/10.4213/rm996openalex-snapshot
Программные алгебры рекурсивных функций
inferred← citeshttps://doi.org/10.48550/arxiv.1802.03292openalex-snapshot
Mathematical Logic in Computer Science
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.