On the expressiveness of choice quantification
Copyright policy )On the expressiveness of choice quantification
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
- Vrije Universiteit Amsterdam Netherlands
- Technical University Eindhoven Netherlands
Logic in computer science, input prefix mechanism, process algebras, Specification and verification (program logics, model checking, etc.), transition trees, Logic, Process algebra, Transition tree, Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.), choice quantifiers, Choice quantification, Input prefix mechanism, Word problems, etc. in computability and recursion theory
Logic in computer science, input prefix mechanism, process algebras, Specification and verification (program logics, model checking, etc.), transition trees, Logic, Process algebra, Transition tree, Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.), choice quantifiers, Choice quantification, Input prefix mechanism, Word problems, etc. in computability and recursion theory
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).4 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!