3 results
Tadeusz Litak ; Dirk Pattinson ; Katsuhiko Sano ; Lutz Schröder.
We propose a generalization of first-order logic originating in a neglected work by C.C. Chang: a natural and generic correspondence language for any types of structures which can be recast as Set-coalgebras. We discuss axiomatization and completeness results for several natural classes of such […]
Published on March 20, 2018
Dirk Pattinson ; Mina Mohammadian.
We develop a constructive theory of continuous domains from the perspective of program extraction. Our goal that programs represent (provably correct) computation without witnesses of correctness is achieved by formulating correctness assertions classically. Technically, we start from a predomain […]
Published on March 2, 2021
Jim de Groot ; Dirk Pattinson.
We extend the meet-implication fragment of propositional intuitionistic logic with a meet-preserving modality. We give semantics based on semilattices and a duality result with a suitable notion of descriptive frame. As a consequence we obtain completeness and identify a common (modal) fragment of a […]
Published on July 14, 2022