Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
156 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Truth Factors (2404.14470v1)

Published 22 Apr 2024 in cs.LO

Abstract: Truth refers to the satisfaction relation used to define the semantics of model-theoretic languages. The satisfaction relation for first order languages (truth classification), and the preservation of truth by first order interpretations (truth infomorphism), is a motivating example in the theory of Information Flow (IF) (Barwise and Seligman 1997). The abstract theory of satisfaction is the basis for the theory of institutions (Goguen and Burstall 1992). Factoring refers to categorical factorization systems. The concept lattice, which is the central structure studied by the theory of Formal Concept Analysis (FCA) (Ganter and Wille 1999), is constructed by a factorization. The study of classification structures (IF) and the study of conceptual structures (FCA) aim (at least is part) to provide a principled foundation for the logical theory of knowledge representation and organization. In an effort to unify these two areas, the paper "Distributed Conceptual Structures" (Kent 2002) abstracted the basic theorem of FCA in order to established three levels of categorical equivalence between classification structures and conceptual structures. In this paper we refine this approach by resolving the equivalence as the factorization of three isomorphic versions: relation, function and Galois connection. We develop the latter more algebraic version of the equivalence as the polar factorization of Galois connections. We advocate this abstract adjunctive representation of classification and conceptual structures.

Summary

We haven't generated a summary for this paper yet.