On the expressiveness of choice quantification
type: Item
instance of: scholarly article
title: On the expressiveness of choice quantification
zbMATH Open document ID: 1026.03018
DOI: 10.1016/S0168-0072(02)00082-9
author: Bas Luttik
published in: Annals of Pure and Applied Logic
publication date: 2003-05-22T00:00:00Z
Mathematics Subject Classification ID: 03B70
Mathematics Subject Classification ID: 68Q85
Mathematics Subject Classification ID: 03D40
Mathematics Subject Classification ID: 68Q60
zbMATH DE Number: 1915311
zbMATH Keywords: input prefix mechanism
zbMATH Keywords: process algebras
zbMATH Keywords: transition trees
zbMATH Keywords: choice quantifiers
describes a project that uses: LOTOS
MaRDI profile type: Publication
cites work: Real time process algebra
cites work: On sequential composition, action prefixes and process prefix
cites work: Process Algebra
cites work: The lambda calculus. Its syntax and semantics. Rev. ed.
cites work: Q5186720
cites work: Process algebra for synchronous communication
cites work: Q3934450
cites work: Model theory.
cites work: Q3346295
cites work: Algebraic process verification.
cites work: Q3148335
cites work: Q3257866
cites work: A proof system for communicating processes with value-passing
cites work: Symbolic bisimulations
cites work: A symbolic approach to value-passing processes
cites work: Q3485879
cites work: Q3751631
cites work: Calculi for synchrony and asynchrony
cites work: Q3992568
cites work: Q4248252
cites work: Creative sets
cites work: Computable processes and bisimulation equivalence
cites work: Q5734410
cites work: Q5573961
cites work: The tree identify protocol of IEEE 1394 in \(\mu\)CRL
cites work: Q5537599
cites work: On Computable Numbers, with an Application to the Entscheidungsproblem
full work available at URL: s0168-0072(02)00082-9
OpenAlex ID: W2148143656
description: scientific article; zbMATH DE number 1915311