Record: found
Abstract: not found
Article: not found

Koepke Machines and Satisfiability for Infinitary Propositional Languages

Author(s): Merlin Carl, Benedikt Löwe, Benjamin G. Rin

Publication date: 2017

Journal: Unveiling Dynamics and Complexity

Read this article at

There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

Related collections

Author and article information

Journal

DOI:: 10.1007/978-3-319-58741-7_19

Data availability:

Comments

Comment on this article

scite_

Cited by 1

Some Observations on Infinitary Complexity
Authors: Merlin Carl

See all cited by