On finite alphabets and infinite bases (Q924717): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: W. J. Fokkink / rank
Normal rank
 
Property / author
 
Property / author: W. J. Fokkink / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ic.2007.09.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2133267148 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nested semantics over finite trees are equationally hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ready to Preorder: Get Your BCCSP Axiomatization for Free! / rank
 
Normal rank
Property / cites work
 
Property / cites work: Processes, Terms and Cycles: Steps on the Road to Infinity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Finite Equational Base for CCS with Left Merge and Communication Merge / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4449168 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Finite Alphabets and Infinite Bases III: Simulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of Software Science and Computation Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2754192 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of Software Science and Computation Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2760238 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equational theory of positive numbers with exponentiation is not finitely axiomatizable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial evaluation and \(\omega\)-completeness of algebraic specifications / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Logic of Equality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tools for proving inductive equalities, relative completeness, and \(\omega\)-completeness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identities in Two-Valued Calculi / rank
 
Normal rank
Property / cites work
 
Property / cites work: TARSKI’S FINITE BASIS PROBLEM IS UNDECIDABLE / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3751631 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A calculus of communicating systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992568 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3999206 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5534915 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3050481 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The λ-calculus is ω-incomplete / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:15, 28 June 2024

scientific article
Language Label Description Also known as
English
On finite alphabets and infinite bases
scientific article

    Statements

    On finite alphabets and infinite bases (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    19 May 2008
    0 references
    0 references
    0 references
    0 references
    0 references
    concurrency
    0 references
    process algebra
    0 references
    equational theory
    0 references
    \(\omega \)-completeness
    0 references
    0 references