Cover Image

Domains, Information Frames, Rough Sets: An Equivalence of Categories

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Spreen, Dieter
Format:	Preprint
Published:	2025
Subjects:	Logic in Computer Science Logic 06B35, 68Q55 F.3.m
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Domains, Information Frames, and Their Logic
by: Spreen, Dieter
Published: (2025)

Continuous and algebraic domains in univalent foundations
by: de Jong, Tom, et al.
Published: (2024)

Matching logic -- a new axiomatization
by: Leuştean, Laurenţiu, et al.
Published: (2025)

Notes on applicative matching logic
by: Leuştean, Laurenţiu
Published: (2025)

Truth-Aware Decoding: A Program-Logic Approach to Factual Language Generation
by: Alpay, Faruk, et al.
Published: (2025)

Commutative N-polyregular functions
by: Lopez, Aliaume
Published: (2024)

Universal Gluing and Contextual Choice: Categorical Logic and the Foundations of Analytic Approximation
by: Santacana, Andreu Ballus
Published: (2025)

A Classifying Topos for the Spectrum of Equivalences
by: Oggad, Kenan
Published: (2026)

Robust Topology and the Hausdorff-Smyth Monad on Metric Spaces over Continuous Quantales
by: Dagnino, Francesco, et al.
Published: (2025)

A Domain-Theoretic Foundation for Imprecise Probability and Credal Sets
by: Edalat, Abbas, et al.
Published: (2026)

A Cut-Free Sequent Calculus for the Analysis of Finite-Trace Properties in Concurrent Systems
by: Fusco, Ludovico, et al.
Published: (2025)

Understanding and Improving Automated Proof Synthesis for Interactive Theorem Provers
by: Zhang, Manqing, et al.
Published: (2026)

Recursive Completion in Higher K-Models: Front-Seed Semantics, Proof-Relevant Witnesses, and the K-Infinity Model
by: Martinez-Rivillas, Daniel O., et al.
Published: (2026)

Formalizing Computational Paths and Fundamental Groups in Lean
by: Ramos, Arthur F., et al.
Published: (2025)

A declarative approach to specifying distributed algorithms using three-valued modal logic
by: Gabbay, Murdoch J., et al.
Published: (2025)

On Equivalent Characterizations of NP in Abstract Models of Computation
by: Kirn, Jeremy C., et al.
Published: (2025)

Principal Types as Partial Involutions
by: Honsell, Furio, et al.
Published: (2024)

The Maude strategy language
by: Eker, Steven, et al.
Published: (2024)

Compositionality in Coalgebraic Trace Semantics
by: Jourde, Robin, et al.
Published: (2026)

Minimalistic System Modelling: Behaviours, Interfaces, and Local Reasoning
by: Galmiche, Didier, et al.
Published: (2024)

The syntactic side of autonomous categories enriched over generalised metric spaces
by: Dahlqvist, Fredrik, et al.
Published: (2022)

The Orientation Boundary for Step-Duplicating Recursors: Mechanized Impossibility, Escape, and Certification
by: Rahnama, Moses
Published: (2025)

Reversible computations are computations
by: Aubert, Clément, et al.
Published: (2025)

Transfinite Fixed Points in Alpay Algebra as Ordinal Game Equilibria in Dependent Type Theory
by: Alpay, Faruk, et al.
Published: (2025)

Towards a theory of natural directed paths
by: Gaucher, Philippe
Published: (2023)

The Solver's Paradox in Formal Problem Spaces
by: Rosko, Milan
Published: (2025)

A Logspace Constructive Proof of L=SL
by: Buss, Sam, et al.
Published: (2025)

The Seifert-van Kampen Theorem via Computational Paths: A Formalized Approach to Computing Fundamental Groups
by: Ramos, Arthur F., et al.
Published: (2025)

An Optimal 14-Symbol Hybrid Basis for BCH-Algebras
by: Ramani, Mahesh, et al.
Published: (2026)

Unifying lower bounds for algebraic machines, semantically
by: Seiller, Thomas, et al.
Published: (2018)

An Expressive Trace Logic for Recursive Programs
by: Gurov, Dilian, et al.
Published: (2024)

Simulating and model checking membrane systems using strategies in Maude
by: Rubio, Rubén, et al.
Published: (2024)

2-Coherent Internal Models of Homotopical Type Theory
by: Chen, Joshua
Published: (2025)

Cogent argument extensions are weakly admissible but not vice versa
by: Bodanza, Gustavo
Published: (2025)

Arithmetics within the Linear Time Hierarchy
by: Pollett, Chris
Published: (2025)

Monitoring Hyperproperties over Observed and Constructed Traces
by: Chalupa, Marek, et al.
Published: (2025)

Provability in BI's Sequent Calculus is Decidable
by: Gheorghiu, Alexander, et al.
Published: (2021)

Decidable Reversible Equivalences for Finite Petri Nets
by: Gorrieri, Roberto, et al.
Published: (2025)

Braids, twists, trace and duality in combinatory algebras
by: Hasegawa, Masahito, et al.
Published: (2024)

Complexities of Well-Quasi-Ordered Substructural Logics
by: Galatos, Nikolaos, et al.
Published: (2025)