Verisimilitude via Vietoris

DOI10.1093/LOGCOM/2.6.709MaRDI QIDQ5286913zbMATH OpenOpenAlexFDO

Authors Chris Brink, J. J. C. Vermeulen, J. P. G. Pretorius

Publication date 17 November 1993

Published in Journal Of Logic And Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/logcom/2.6.709

zbMATH Keywords

powerdomainsStone spaceVietoris topologytruthlikenessverisimilitudedenotational semantics of programming languagespower structuresEgli-Milner orderinglogic of finite observationshyperspaces of domainsverisimilar ordering of theories

Mathematics Subject Classification ID

Continuous lattices and posets, applications (06B35) Semantics in the theory of computing (68Q55) Models of other mathematical theories (03C65) Other applications of logic (03B80)

Recommendations

• Computing verisimilitude
• Point-free geometry and verisimilitude of theories
• Exploring and extending the landscape of conjunctive approaches to verisimilitude
• Verisimilitude based on concept analysis
• The content, consequence and likeness approaches to verisimilitude: compatibility, trivialization, and underdetermination

Cited in

(3)

• Verisimilitude: views and reviews
• Computing verisimilitude
• Point-free geometry and verisimilitude of theories

This page was built for publication: Verisimilitude via Vietoris

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5286913)