On the public citation graph
Algorithmic properties of structures
0 signed · 92 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1016/s0016-0032(64)90604-0openalex-snapshot
Lectures on modern mathematics
inferredcites →https://doi.org/10.1016/s0022-0000(67)80014-xopenalex-snapshot
Some definitional suggestions for automata theory
inferredcites →https://doi.org/10.1016/s0049-237x(08)x7064-8openalex-snapshot
The Foundations of Intuitionistic Mathematics
inferredcites →https://doi.org/10.1070/rm1961v016n03abeh001120openalex-snapshot
CONSTRUCTIVE ALGEBRAS I
inferredcites →https://doi.org/10.1090/s0002-9947-1960-0113807-4openalex-snapshot
Computable Algebra, General Theory and Theory of Computable Fields
inferredcites →https://doi.org/10.1145/321160.321170openalex-snapshot
Computability of Recursive Functions
inferredcites →https://doi.org/10.1515/9781400882618-002openalex-snapshot
Representation of Events in Nerve Nets and Finite Automata
inferredcites →https://doi.org/10.2307/1970290openalex-snapshot
Recursive Unsolvability of Post's Problem of "Tag" and other Topics in Theory of Turing Machines
inferredcites →https://doi.org/10.2307/2313661openalex-snapshot
The Foundations of Intuitionistic Mathematics.
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.19930390143openalex-snapshot
Ternary operations as primitive notions for constructive plane geometry III
inferred← citeshttps://doi.org/10.1002/malq.19940400111openalex-snapshot
Ternary Operations as Primitive Notions for Constructive Plane Geometry IV
inferred← citeshttps://doi.org/10.1002/malq.19980440102openalex-snapshot
Computability of String Functions Over Algebraic Structures Armin Hemmerling
inferred← citeshttps://doi.org/10.1002/mana.19790900120openalex-snapshot
Beitrag zur algebraischen Rekursionstheorie
inferred← citeshttps://doi.org/10.1007/3-540-06841-4_92openalex-snapshot
Effectivity problems of algorithmic logic
inferred← citeshttps://doi.org/10.1007/3-540-06953-4_1openalex-snapshot
Simple program schemes and formal languages
inferred← citeshttps://doi.org/10.1007/3-540-07162-8_702openalex-snapshot
ω+ -valued algorithmic logic as a tool to investigate procedures
inferred← citeshttps://doi.org/10.1007/3-540-07389-2_210openalex-snapshot
Formalization of algorithmic reasoning
inferred← citeshttps://doi.org/10.1007/3-540-08442-8_113openalex-snapshot
On Finite and Infinite Computations
inferred← citeshttps://doi.org/10.1007/3-540-08921-7_71openalex-snapshot
Dynamic theories of real and complex numbers
inferred← citeshttps://doi.org/10.1007/3-540-11160-3_3openalex-snapshot
PAL — Propositional algorithmic logic
inferred← citeshttps://doi.org/10.1007/3-540-11160-3_4openalex-snapshot
Propositional dynamic logics of programs: A survey
inferred← citeshttps://doi.org/10.1007/3-540-11160-3_5openalex-snapshot
On the algorithmic theory of dictionaries
inferred← citeshttps://doi.org/10.1007/3-540-11981-7_8openalex-snapshot
Algorithmic properties of finitely generated structures
inferred← citeshttps://doi.org/10.1007/3-540-12896-4_368openalex-snapshot
Necessary and sufficient conditions for the universality of programming formalisms
inferred← citeshttps://doi.org/10.1007/978-1-4899-5841-9_3openalex-snapshot
Semantics of Programming Languages
inferred← citeshttps://doi.org/10.1007/978-3-030-76020-5_10openalex-snapshot
Some Thoughts on Computational Models: From Massive Human Computing to Abstract State Machines, and Beyond
inferred← citeshttps://doi.org/10.1007/978-3-030-77657-2_5openalex-snapshot
Aristotle’s Relations: An Interpretation in Combinatory Logic
inferred← citeshttps://doi.org/10.1007/978-3-031-44490-6_8openalex-snapshot
Actions and Deontology: Janusz Czelakowski on Actions and their Assessment
inferred← citeshttps://doi.org/10.1007/978-3-540-69850-0_10openalex-snapshot
From Church and Prior to PSL
inferred← citeshttps://doi.org/10.1007/978-3-540-78127-1_36openalex-snapshot
From Monadic Logic to PSL
inferred← citeshttps://doi.org/10.1007/978-3-540-92701-3_7openalex-snapshot
From Philosophical to Industrial Logics
inferred← citeshttps://doi.org/10.1007/978-3-642-36736-6_11openalex-snapshot
Acts of Geometrical Construction in the Spherics of Theodosios
inferred← citeshttps://doi.org/10.1007/978-3-642-45321-2_5openalex-snapshot
From Löwenheim to PSL and SVA
inferred← citeshttps://doi.org/10.1007/978-3-642-76799-9_8openalex-snapshot
Some Lectures on Modal Logic
inferred← citeshttps://doi.org/10.1007/978-3-642-79361-5_10openalex-snapshot
Computable Functions on Stream Algebras
inferred← citeshttps://doi.org/10.1007/978-3-662-21545-6_45openalex-snapshot
Effectivity Problems of Algorithmic Logic
inferred← citeshttps://doi.org/10.1007/978-94-010-1138-9_15openalex-snapshot
Algorithmic Logic, a Tool for Investigations of Programs
inferred← citeshttps://doi.org/10.1007/bf00264469openalex-snapshot
LAR: A logic of algorithmic reasoning
inferred← citeshttps://doi.org/10.1007/bf00288773openalex-snapshot
Necessary and sufficient conditions for the universality of programming formalisms
inferred← citeshttps://doi.org/10.1007/bf00370471openalex-snapshot
Algorithmic logic. Multiple-valued extensions
inferred← citeshttps://doi.org/10.1007/bf01110504openalex-snapshot
Zur Einbettungsbedingung im Zusammenhang mit einer Programmiersprache von Engeler
inferred← citeshttps://doi.org/10.1007/bf01691101openalex-snapshot
Zur Theorie Algorithmisch Abgeschlossener Modellklassen
inferred← citeshttps://doi.org/10.1007/bf02246433openalex-snapshot
Function iteration logics and flowchart schemata
inferred← citeshttps://doi.org/10.1007/bf02737110openalex-snapshot
Program-substitution and admissibility of rules in algorithmic logic
inferred← citeshttps://doi.org/10.1007/bfb0012792openalex-snapshot
Algorithmic theories of data structures
inferred← citeshttps://doi.org/10.1007/bfb0025787openalex-snapshot
A note on equivalences among logics of programs
inferred← citeshttps://doi.org/10.1007/bfb0060624openalex-snapshot
Proof theory and the accuracy of computations
inferred← citeshttps://doi.org/10.1007/bfb0079682openalex-snapshot
Remarks on the theory of geometrical constructions
inferred← citeshttps://doi.org/10.1007/s11225-010-9224-zopenalex-snapshot
A Contraction-free and Cut-free Sequent Calculus for Propositional Dynamic Logic
inferred← citeshttps://doi.org/10.1016/0022-0000(80)90032-xopenalex-snapshot
Computable queries for relational data bases
inferred← citeshttps://doi.org/10.1016/0022-0000(84)90027-8openalex-snapshot
Equivalences among logics of programs
inferred← citeshttps://doi.org/10.1016/0304-3975(80)90005-5openalex-snapshot
Proving the correctness of regular deterministic programs: A unifying survey using dynamic logic
inferred← citeshttps://doi.org/10.1016/0304-3975(83)90013-0openalex-snapshot
Definability by programs in first-order structures
inferred← citeshttps://doi.org/10.1016/0304-3975(85)90225-7openalex-snapshot
Process logic with regular formulas
inferred← citeshttps://doi.org/10.1016/0304-3975(94)90091-4openalex-snapshot
Stratified least fixpoint logic
inferred← citeshttps://doi.org/10.1016/b978-0-444-88074-1.50019-6openalex-snapshot
Logics of Programs
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/j.cosrev.2008.02.003openalex-snapshot
A survey of state vectors
inferred← citeshttps://doi.org/10.1016/j.exmath.2010.09.004openalex-snapshot
The axiomatics of ordered geometry
inferred← citeshttps://doi.org/10.1016/j.jal.2007.02.001openalex-snapshot
Axiomatizing geometric constructions
inferred← citeshttps://doi.org/10.1016/j.jco.2005.02.001openalex-snapshot
P=NP for some structures over the binary words
inferred← citeshttps://doi.org/10.1016/j.jlap.2003.10.001openalex-snapshot
Computable total functions on metric algebras, universal algebraic specifications and dynamical systems
inferred← citeshttps://doi.org/10.1016/s0019-9958(70)90186-5openalex-snapshot
The theory of interacting local automata
inferred← citeshttps://doi.org/10.1016/s0019-9958(84)80023-6openalex-snapshot
On static logics, dynamic logics, and complexity classes
inferred← citeshttps://doi.org/10.1016/s0019-9958(84)80055-8openalex-snapshot
Diamond formulas: A fragment of dynamic logic with recursively enumerable validity problem
inferred← citeshttps://doi.org/10.1016/s0022-0000(69)80027-9openalex-snapshot
Regular expressions and the equivalence of programs
inferred← citeshttps://doi.org/10.1016/s0022-0000(71)80008-9openalex-snapshot
Algorithmic approximations
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)71821-4openalex-snapshot
Model Theoretic Issues in Theoretical Computer Science, Part I: Relational Data Bases and Abstract Data Types
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)71963-3openalex-snapshot
Computation Over Abstract Structures: Serial and Parallel Procedures and Friedman's Effective Definitional Schemes
inferred← citeshttps://doi.org/10.1016/s0049-237x(09)70652-4openalex-snapshot
Cumulative Logic Programs and Modelling
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00289-8openalex-snapshot
On approximate and algebraic computability over the real numbers
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00297-7openalex-snapshot
Computation by ‘While’ programs on topological partial algebras
inferred← citeshttps://doi.org/10.1051/ita/1988220100571openalex-snapshot
Étude et implémentation d'un système de déduction pour logique algorithmique
inferred← citeshttps://doi.org/10.1109/sfcs.1978.2openalex-snapshot
A decidability result for a second order process logic
inferred← citeshttps://doi.org/10.1109/swat.1968.26openalex-snapshot
Some formal properties of a class of non-deterministic program schemata
inferred← citeshttps://doi.org/10.1109/swat.1972.20openalex-snapshot
Representing program schemes in logic
inferred← citeshttps://doi.org/10.1145/800119.803902openalex-snapshot
Parallel scheduling of programs in a restricted model of computation
inferred← citeshttps://doi.org/10.1145/800133.804362openalex-snapshot
A practical decision method for propositional dynamic logic (Preliminary Report)
inferred← citeshttps://doi.org/10.1201/9780429161612-9openalex-snapshot
The exact complexity of the Tutte polynomial
inferred← citeshttps://doi.org/10.1305/ndjfl/1093891904openalex-snapshot
Non-definability of certain semantic properties of programs.
inferred← citeshttps://doi.org/10.3390/axioms5020016openalex-snapshot
Contribution of Warsaw Logicians to Computational Logic
inferred← citeshttps://doi.org/10.48550/arxiv.2007.04252openalex-snapshot
Aristotle' Relations: An Interpretation in Combinatory Logic
inferred← citeshttps://doi.org/10.48550/arxiv.2107.08253openalex-snapshot
A proof theoretic basis for relational semantics
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.