On the public citation graph
Action logic and pure induction
0 signed · 179 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.1006/inco.1994.1037openalex-snapshot
A Completeness Theorem for Kleene Algebras and the Algebra of Regular Events
inferredcites →https://doi.org/10.1007/978-1-4612-9839-7openalex-snapshot
Categories for the Working Mathematician
inferredcites →https://doi.org/10.1007/bf01379149openalex-snapshot
Modeling concurrency with partial orders
inferredcites →https://doi.org/10.1007/bfb0012779openalex-snapshot
A programming language for the inductive sets, and applications
inferredcites →https://doi.org/10.1007/bfb0029594openalex-snapshot
On kleene algebras and closed semirings
inferredcites →https://doi.org/10.1007/bfb0043079openalex-snapshot
Dynamic algebras as a well-behaved fragment of relation algebras
inferredcites →https://doi.org/10.1007/bfb0063101openalex-snapshot
Review of the elements of 2-categories
inferredcites →https://doi.org/10.1016/0022-0000(82)90012-5openalex-snapshot
Structure and complexity of relational queries
inferredcites →https://doi.org/10.1016/0304-3975(88)90001-1openalex-snapshot
Fiftieth volume of theoretical computer science
inferredcites →https://doi.org/10.1016/s0019-9958(84)80045-5openalex-snapshot
A programming language for the inductive sets, and applications
inferredcites →https://doi.org/10.1016/s0049-237x(08)x7092-2openalex-snapshot
Elementary Induction on Abstract Structures
inferredcites →https://doi.org/10.1038/135131a0openalex-snapshot
Collected Papers of Charles Sanders Peirce
inferredcites →https://doi.org/10.1109/swat.1972.29openalex-snapshot
The equivalence problem for regular expressions with squaring requires exponential space
inferredcites →https://doi.org/10.1145/321312.321326openalex-snapshot
Two Complete Axiom Systems for the Algebra of Regular Events
inferredcites →https://doi.org/10.1145/800141.804649openalex-snapshot
Dynamic algebras and the nature of induction
inferredcites →https://doi.org/10.2307/2372123openalex-snapshot
Boolean Algebras with Operators. Part I
inferredcites →https://doi.org/10.2307/25058006openalex-snapshot
Description of a Notation for the Logic of Relatives, Resulting from an Amplification of the Conceptions of Boole's Calculus of Logic
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.19970430108openalex-snapshot
Powerset Residuated Algebras and Generalized Lambek Calculus
inferred← citeshttps://doi.org/10.1006/inco.1997.2665openalex-snapshot
Axiomatizing Shuffle and Concatenation in Languages
inferred← citeshttps://doi.org/10.1006/inco.2000.2889openalex-snapshot
On Equations for Union-Free Regular Languages
inferred← citeshttps://doi.org/10.1007/11828563_7openalex-snapshot
On the Complexity of the Equational Theory of Relational Action Algebras
inferred← citeshttps://doi.org/10.1007/3-540-44683-4_56openalex-snapshot
On the Equational Definition of the Least Prefixed Point
inferred← citeshttps://doi.org/10.1007/3-540-45793-3_10openalex-snapshot
Greibach Normal Form in Algebraically Complete Semirings
inferred← citeshttps://doi.org/10.1007/3-540-48754-9_21openalex-snapshot
A Tableau Calculus for a Temporal Logic with Temporal Connectives
inferred← citeshttps://doi.org/10.1007/3-540-55511-0_11openalex-snapshot
HSP type theorems in the category of posets
inferred← citeshttps://doi.org/10.1007/3-540-57867-6_17openalex-snapshot
Unified algebras and abstract syntax
inferred← citeshttps://doi.org/10.1007/3-540-59293-8_190openalex-snapshot
Rational mechanics and natural mathematics
inferred← citeshttps://doi.org/10.1007/3-540-60084-1_60openalex-snapshot
Nonfinite axiomatizability of the equational theory of shuffle
inferred← citeshttps://doi.org/10.1007/3-540-61042-1_35openalex-snapshot
Kleene algebra with tests and commutativity conditions
inferred← citeshttps://doi.org/10.1007/978-3-030-31038-7_1openalex-snapshot
A Calculus of Space, Time, and Causality: Its Algebra, Geometry, Logic
inferred← citeshttps://doi.org/10.1007/978-3-030-33636-3_8openalex-snapshot
Cylindric Kleene Lattices for Program Construction
inferred← citeshttps://doi.org/10.1007/978-3-030-38808-9_9openalex-snapshot
Iterative Division in the Distributive Full Non-associative Lambek Calculus
inferred← citeshttps://doi.org/10.1007/978-3-030-62077-6_1openalex-snapshot
A $$\varPi _1^0$$-Bounded Fragment of Infinitary Action Logic with Exponential
inferred← citeshttps://doi.org/10.1007/978-3-030-65840-3_10openalex-snapshot
Complexity of Commutative Infinitary Action Logic
inferred← citeshttps://doi.org/10.1007/978-3-030-76920-8_5openalex-snapshot
An Algebraic Glimpse at Bunched Implications and Separation Logic
inferred← citeshttps://doi.org/10.1007/978-3-030-86059-2_19openalex-snapshot
Complexity of a Fragment of Infinitary Action Logic with Exponential via Non-well-founded Proofs
inferred← citeshttps://doi.org/10.1007/978-3-030-88701-8_23openalex-snapshot
On Tools for Completeness of Kleene Algebra with Hypotheses
inferred← citeshttps://doi.org/10.1007/978-3-031-15298-6_14openalex-snapshot
Embedding Kozen-Tiuryn Logic into Residuated One-Sorted Kleene Algebra with Tests
inferred← citeshttps://doi.org/10.1007/978-3-031-21780-7_1openalex-snapshot
Complexity of the Lambek Calculus and Its Extensions
inferred← citeshttps://doi.org/10.1007/978-3-031-44245-2_16openalex-snapshot
Error Localization for Sequential Effect Systems
inferred← citeshttps://doi.org/10.1007/978-3-031-47963-2_7openalex-snapshot
On the Complexity of Reasoning in Kleene Algebra with Commutativity Conditions
inferred← citeshttps://doi.org/10.1007/978-3-031-62687-6_7openalex-snapshot
Syntactic Concept Lattice Models for Infinitary Action Logic
inferred← citeshttps://doi.org/10.1007/978-3-032-05745-7_8openalex-snapshot
On Lambek Grammars with Kleene Star
inferred← citeshttps://doi.org/10.1007/978-3-032-21143-9_2openalex-snapshot
A Survey on Language Completeness of the Lambek Calculus and Its Extensions
inferred← citeshttps://doi.org/10.1007/978-3-032-22469-9_12openalex-snapshot
Complexity of Equational Theories for Relational and Language Action Lattices
inferred← citeshttps://doi.org/10.1007/978-3-319-06025-5_34openalex-snapshot
Arrows Pointing at Arrows: Arrow Logic, Relevance Logic, and Relation Algebras
inferred← citeshttps://doi.org/10.1007/978-3-319-06410-9_6openalex-snapshot
Algebraic Principles for Rely-Guarantee Style Concurrency Verification Tools
inferred← citeshttps://doi.org/10.1007/978-3-319-15075-8_9openalex-snapshot
A Dynamic Logic for Every Season
inferred← citeshttps://doi.org/10.1007/978-3-319-49815-7_8openalex-snapshot
On Interval Dynamic Logic
inferred← citeshttps://doi.org/10.1007/978-3-319-58507-9_5openalex-snapshot
A Logic for Human Actions
inferred← citeshttps://doi.org/10.1007/978-3-319-66902-1_16openalex-snapshot
A Cut-Free Cyclic Proof System for Kleene Algebra
inferred← citeshttps://doi.org/10.1007/978-3-319-70848-5_17openalex-snapshot
On Kleene Algebras for Weighted Computation
inferred← citeshttps://doi.org/10.1007/978-3-540-24615-2_9openalex-snapshot
Relational Models of Lambek Logics
inferred← citeshttps://doi.org/10.1007/978-3-540-24771-5_11openalex-snapshot
The Categories of Kleene Algebras, Action Algebras and Action Lattices Are Related by Adjunctions
inferred← citeshttps://doi.org/10.1007/978-3-642-04639-1_7openalex-snapshot
Composing Partially Ordered Monads
inferred← citeshttps://doi.org/10.1007/978-3-642-15205-4_37openalex-snapshot
Untyping Typed Algebraic Structures and Colouring Proof Nets of Cyclic Linear Logic
inferred← citeshttps://doi.org/10.1007/978-3-642-29485-3_1openalex-snapshot
Residuated Kleene Algebras
inferred← citeshttps://doi.org/10.1007/978-3-642-33314-9_5openalex-snapshot
Automated Reasoning in Higher-Order Regular Algebra
inferred← citeshttps://doi.org/10.1007/978-3-642-38164-5_10openalex-snapshot
Unifying Semantics for Concurrent Programming
inferred← citeshttps://doi.org/10.1007/978-3-662-48057-1_2openalex-snapshot
Equational Properties of Fixed Point Operations in Cartesian Categories: An Overview
inferred← citeshttps://doi.org/10.1007/978-3-662-55386-2_13openalex-snapshot
The Lambek Calculus with Iteration: Two Variants
inferred← citeshttps://doi.org/10.1007/978-94-010-0526-5_3openalex-snapshot
A Representation of Relation Algebras Using Routley-Meyer Frames
inferred← citeshttps://doi.org/10.1007/978-94-017-0487-8_14openalex-snapshot
Conjoining and Disjoining on Different Levels
inferred← citeshttps://doi.org/10.1007/bf00159342openalex-snapshot
Extending Lambek grammars to basic categorial grammars
inferred← citeshttps://doi.org/10.1007/bf00370685openalex-snapshot
Dynamic algebras: Examples, constructions, applications
inferred← citeshttps://doi.org/10.1007/bf01048354openalex-snapshot
Merging without mystery or: Variables in dynamics semantics
inferred← citeshttps://doi.org/10.1007/bf01050788openalex-snapshot
Sequence semantics for dynamic predicate logic
inferred← citeshttps://doi.org/10.1007/bfb0023771openalex-snapshot
Towards Kleene Algebra with recursion
inferred← citeshttps://doi.org/10.1007/bfb0026562openalex-snapshot
Time and information in sequential and concurrent computation
inferred← citeshttps://doi.org/10.1007/bfb0084795openalex-snapshot
The duality of time and information
inferred← citeshttps://doi.org/10.1007/bfb0095045openalex-snapshot
A mechanisation of classical modal tense logics using isabelle
inferred← citeshttps://doi.org/10.1007/s00012-011-0142-3openalex-snapshot
Axiomatizability of positive algebras of binary relations
inferred← citeshttps://doi.org/10.1007/s000120050146openalex-snapshot
Separability and decidability results for varieties of J�nsson dynamic algebras
inferred← citeshttps://doi.org/10.1007/s00500-021-05593-9openalex-snapshot
A semantics and a logic for Fuzzy Arden Syntax
inferred← citeshttps://doi.org/10.1007/s10469-020-09586-9openalex-snapshot
A Restricted Fragment of the Lambek Calculus with Iteration and Intersection Operations
inferred← citeshttps://doi.org/10.1007/s10817-014-9318-9openalex-snapshot
On the Fine-Structure of Regular Algebra
inferred← citeshttps://doi.org/10.1007/s11225-008-9116-7openalex-snapshot
Infinitary Action Logic: Complexity, Models and Grammars
inferred← citeshttps://doi.org/10.1007/s11225-013-9473-8openalex-snapshot
On the Dynamic Logic of Agency and Action
inferred← citeshttps://doi.org/10.1007/s11225-014-9574-zopenalex-snapshot
Lower Semilattice-Ordered Residuated Semigroups and Substructural Logics
inferred← citeshttps://doi.org/10.1007/s11225-022-10021-6openalex-snapshot
Infinitary Action Logic with Multiplexing
inferred← citeshttps://doi.org/10.1007/s11229-014-0513-3openalex-snapshot
The equational theories of representable residuated semigroups
inferred← citeshttps://doi.org/10.1007/s11432-006-2031-5openalex-snapshot
Modeling and verifying Web services driven by requirements: An ontology-based approach
inferred← citeshttps://doi.org/10.1016/0304-3975(94)90190-2openalex-snapshot
An overview of transaction logic
inferred← citeshttps://doi.org/10.1016/0304-3975(95)80010-7openalex-snapshot
Rewriting extended regular expressions
inferred← citeshttps://doi.org/10.1016/0304-3975(95)80024-4openalex-snapshot
Rewriting extended regular expressions
inferred← citeshttps://doi.org/10.1016/b978-1-4832-1452-8.50136-6openalex-snapshot
Modalities Over Actions, I. Model Theory
inferred← citeshttps://doi.org/10.1016/j.apal.2004.10.008openalex-snapshot
Algebraically complete semirings and Greibach normal form
inferred← citeshttps://doi.org/10.1016/j.apal.2021.103057openalex-snapshot
Infinitary action logic with exponentiation
inferred← citeshttps://doi.org/10.1016/j.entcs.2018.10.004openalex-snapshot
A Family of Graded Epistemic Logics
inferred← citeshttps://doi.org/10.1016/j.jlamp.2015.09.012openalex-snapshot
Developments in concurrent Kleene algebra
inferred← citeshttps://doi.org/10.1016/j.jlamp.2016.03.004openalex-snapshot
An exercise on the generation of many-valued dynamic logics
inferred← citeshttps://doi.org/10.1016/j.jlap.2009.10.001openalex-snapshot
Axiomatizing the equational theory of regular tree languages
inferred← citeshttps://doi.org/10.1016/j.jlap.2014.02.001openalex-snapshot
Programming and automating mathematics in the Tarski–Kleene hierarchy
inferred← citeshttps://doi.org/10.1016/j.scico.2019.01.007openalex-snapshot
On interval dynamic logic: Introducing quasi-action lattices
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00412-7openalex-snapshot
On the equational definition of the least prefixed point
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00248-4openalex-snapshot
The equational logic of fixed points
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00079-1openalex-snapshot
The variety of Kleene algebras with conversion is not finitely based
inferred← citeshttps://doi.org/10.1017/s096012950000030xopenalex-snapshot
Demonic operators and monotype factors
inferred← citeshttps://doi.org/10.1017/s0960129515000390openalex-snapshot
Computing with relational machines
inferred← citeshttps://doi.org/10.1017/s0960129518000361openalex-snapshot
Equational properties of fixed-point operations in cartesian categories: An overview
inferred← citeshttps://doi.org/10.1017/s0960129524000045openalex-snapshot
Implicational Kleene algebra with domain and the substructural logic of partial correctness
inferred← citeshttps://doi.org/10.1017/s0960129597002491openalex-snapshot
A menagerie of non-finitely based process semantics over BPA* – from ready simulation to completed traces
inferred← citeshttps://doi.org/10.1017/s1471068402001576openalex-snapshot
Using methods of declarative logic programming for intelligent information agents
inferred← citeshttps://doi.org/10.1017/s1755020310000249openalex-snapshot
POSITIVE FRAGMENTS OF RELEVANCE LOGIC AND ALGEBRAS OF BINARY RELATIONS
inferred← citeshttps://doi.org/10.1023/a:1004295308014openalex-snapshot
A System of Dynamic Modal Logic
inferred← citeshttps://doi.org/10.1023/a:1008230514856openalex-snapshot
Dynamic Negation, the One and Only
inferred← citeshttps://doi.org/10.1023/b:jlli.0000028336.64373.f6openalex-snapshot
Logics for Classes of Boolean Monoids
inferred← citeshttps://doi.org/10.1023/b:stud.0000032089.54776.63openalex-snapshot
From Semirings to Residuated Kleene Lattices
inferred← citeshttps://doi.org/10.1080/11663081.1993.10510805openalex-snapshot
Dynamic logic with program specifications and its relational proof system
inferred← citeshttps://doi.org/10.1093/jigpal/5.4.505openalex-snapshot
Combinators and structurally free logic
inferred← citeshttps://doi.org/10.1093/jigpal/jzq044openalex-snapshot
On representable ordered residuated semigroups
inferred← citeshttps://doi.org/10.1093/jigpal/jzs045openalex-snapshot
Reasoning about types of action and agent capabilities
inferred← citeshttps://doi.org/10.1093/logcom/exl036openalex-snapshot
On Action Logic: Equational Theories of Action Algebras
inferred← citeshttps://doi.org/10.1093/logcom/exu064openalex-snapshot
Multi-type display calculus for propositional dynamic logic
inferred← citeshttps://doi.org/10.1093/logcom/exu068openalex-snapshot
Multi-type display calculus for dynamic epistemic logic
inferred← citeshttps://doi.org/10.1109/csse.2008.465openalex-snapshot
Ontology-Based Description Frame of Information Security Service-Ability for Customer Demands
inferred← citeshttps://doi.org/10.1109/csse.2008.468openalex-snapshot
Customer Demands-Based Formalized Expression of Information Security Resources
inferred← citeshttps://doi.org/10.1109/icde.1996.492212openalex-snapshot
Synthesizing distributed constrained events from transactional workflow specifications
inferred← citeshttps://doi.org/10.1109/lics.1995.523278openalex-snapshot
The Stone gamut: a coordinatization of mathematics
inferred← citeshttps://doi.org/10.1109/lics.2001.932502openalex-snapshot
Intuitionistic linear logic and partial correctness
inferred← citeshttps://doi.org/10.1109/lics.2019.8785659openalex-snapshot
The Logic of Action Lattices is Undecidable
inferred← citeshttps://doi.org/10.1109/phycmp.1994.363682openalex-snapshot
Chu spaces: automata with quantum aspects
inferred← citeshttps://doi.org/10.1109/tr.2017.2665164openalex-snapshot
An Approach for Identifying and Analyzing Implicit Interactions in Distributed Systems
inferred← citeshttps://doi.org/10.1145/170035.170150openalex-snapshot
Task scheduling using intertask dependencies in Carnot
inferred← citeshttps://doi.org/10.1145/1925844.1926429openalex-snapshot
Regular expression containment
inferred← citeshttps://doi.org/10.1145/3450272openalex-snapshot
Polymorphic Iterable Sequential Effect Systems
inferred← citeshttps://doi.org/10.1145/772062.772066openalex-snapshot
Substructural logic and partial correctness
inferred← citeshttps://doi.org/10.1305/ndjfl/1040046091openalex-snapshot
Dynamic Bracketing and Discourse Representation
inferred← citeshttps://doi.org/10.1305/ndjfl/1134397663openalex-snapshot
Relational Semantics for Kleene Logic and Action Logic
inferred← citeshttps://doi.org/10.1360/zf2006-36-10-1189openalex-snapshot
需求驱动的Web服务建模及其验证: 一个基于本体的方法
inferred← citeshttps://doi.org/10.14236/ewic/dbpl1995.23openalex-snapshot
Semantical Considerations on Workflows: An Algebra for Intertask Dependencies
inferred← citeshttps://doi.org/10.21146/2074-1472-2001-8-0-282-301openalex-snapshot
Ternary relational semantics and beyond: programs as arguments (data) and programs as functions (programs)
inferred← citeshttps://doi.org/10.2168/lmcs-8(2:13)2012openalex-snapshot
Untyping Typed Algebras and Colouring Cyclic Linear Logic
inferred← citeshttps://doi.org/10.24251/hicss.2017.726openalex-snapshot
Identifying Implicit Component Interactions in Distributed Cyber-Physical Systems
inferred← citeshttps://doi.org/10.26456/mfcsics-21-26openalex-snapshot
Принцип декомпозиции и алгоритмическая неразрешимость для моноидов Клини с делениями
inferred← citeshttps://doi.org/10.3233/fun-2005-68302openalex-snapshot
On Finite Model Property of the Equational Theory of Kleene Algebras
inferred← citeshttps://doi.org/10.3233/fun-2007-78206openalex-snapshot
An Infinitary Sequent System for the Equational Theory of *-continuous Action Lattices
inferred← citeshttps://doi.org/10.4204/eptcs.161.7openalex-snapshot
Kleene Algebras, Regular Languages and Substructural Logics
inferred← citeshttps://doi.org/10.4213/im9480openalex-snapshot
Алгоритмическая сложность теорий коммутативных алгебр Клини
inferred← citeshttps://doi.org/10.4213/im9480eopenalex-snapshot
Algorithmic complexity for theories of commutative Kleene algebras
inferred← citeshttps://doi.org/10.4213/rm10268openalex-snapshot
Алгоритмическая сложность теорий с итерацией Клини
inferred← citeshttps://doi.org/10.4213/rm10268eopenalex-snapshot
Algorithmic complexity of theories with Kleene iteration
inferred← citeshttps://doi.org/10.46298/lmcs-19(1:13)2023openalex-snapshot
A Finite Axiomatisation of Finite-State Automata Using String Diagrams
inferred← citeshttps://doi.org/10.46298/lmcs-20(2:8)2024openalex-snapshot
On Tools for Completeness of Kleene Algebra with Hypotheses
inferred← citeshttps://doi.org/10.48550/arxiv.1312.1225openalex-snapshot
Algebraic Principles for Rely-Guarantee Style Concurrency Verification Tools
inferred← citeshttps://doi.org/10.48550/arxiv.1705.02264openalex-snapshot
A Generic Approach to Flow-Sensitive Polymorphic Effects (Extended Version)
inferred← citeshttps://doi.org/10.48550/arxiv.1705.07309openalex-snapshot
The Lambek calculus with iteration: two variants
inferred← citeshttps://doi.org/10.48550/arxiv.1911.01146openalex-snapshot
Generalising KAT to verify weighted computations
inferred← citeshttps://doi.org/10.5282/ubm/epub.14881openalex-snapshot
State-of-the-art on evolution and reactivity
inferred← citeshttps://doi.org/10.7146/brics.v1i5.21665openalex-snapshot
Unified Algebras and Abstract Syntax
inferred← citeshttps://doi.org/10.7146/brics.v9i46.21761openalex-snapshot
Greibach Normal Form in Algebraically Complete Semirings
inferred← citeshttps://doi.org/10.7146/dpb.v22i461.6934openalex-snapshot
Rewriting Extended Regular Expressions
inferred← citeshttps://doi.org/10.71548/21556openalex-snapshot
On the Modelling, Analysis, and Mitigation of Distributed Covert Channels
inferred← citeshttps://doi.org/10.7551/mitpress/4286.003.0014openalex-snapshot
Actions under Presuppositions
inferred← citeshttps://doi.org/10.7561/sacs.2019.2.141openalex-snapshot
Generalising KAT to Verify Weighted Computations
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.