Abstract
Based on the investigation of the proof system of a disjunctive propositional logic, this paper establishes a purely, syntactic representation of Scott-domains. More precisely, a category of certain proof systems with consequence relations is shown to be equivalent to that of Scott-domains with Scott-continuous functions.
Author supplied keywords
Cite
CITATION STYLE
APA
Wang, L., & Li, Q. (2020). Disjunctive Propositional Logic and Scott Domains. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 12337 LNCS, pp. 327–339). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-030-59267-7_28
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free