On finite alphabets and infinite bases
type: Item
instance of: scholarly article
title: On finite alphabets and infinite bases
zbMATH Open document ID: 1146.68047
author: Taolue Chen
author: Bas Luttik
author: Sumit Nain
author: Wan Fokkink
published in: Information and Computation
publication date: 2008-05-19T00:00:00Z
Mathematics Subject Classification ID: 68Q55
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68Q85
zbMATH DE Number: 5276409
zbMATH Keywords: concurrency
zbMATH Keywords: process algebra
zbMATH Keywords: equational theory
zbMATH Keywords: \(\omega \)-completeness
MaRDI profile type: Publication
full work available at URL: j.ic.2007.09.003
OpenAlex ID: W2133267148
cites work: Nested semantics over finite trees are equationally hard
cites work: Ready to Preorder: Get Your BCCSP Axiomatization for Free!
cites work: Processes, Terms and Cycles: Steps on the Road to Infinity
cites work: A Finite Equational Base for CCS with Left Merge and Communication Merge
cites work: Q4449168
cites work: On Finite Alphabets and Infinite Bases III: Simulation
cites work: Foundations of Software Science and Computation Structures
cites work: Q2754192
cites work: Automata, Languages and Programming
cites work: The linear time -- branching time spectrum. I: The semantics of concrete, sequential processes.
cites work: Equational theory of positive numbers with exponentiation is not finitely axiomatizable
cites work: Partial evaluation and \(\omega\)-completeness of algebraic specifications
cites work: The Logic of Equality
cites work: Tools for proving inductive equalities, relative completeness, and \(\omega\)-completeness
cites work: Identities in Two-Valued Calculi
cites work: TARSKI’S FINITE BASIS PROBLEM IS UNDECIDABLE
cites work: Q3751631
cites work: A calculus of communicating systems
cites work: Q3992568
cites work: Q3999206
cites work: Q5534915
cites work: Q3050481
cites work: The λ-calculus is ω-incomplete
DOI: 10.1016/J.IC.2007.09.003
Recommended article: Foundations of Software Science and Computation Structures
Recommended article: On Finite Alphabets and Infinite Bases III: Simulation
Recommended article: Coding on Countably Infinite Alphabets
Recommended article: Q2997515
Recommended article: Counting Multiplicity over Infinite Alphabets
Recommended article: On the existence of a finite base for systems of equations of infinite words
Recommended article: On the finite basis problem for certain 2-limited words.
Recommended article: Q3495397
Recommended article: Expansions in multiple bases over general alphabets
description: scientific article; zbMATH DE number 5276409