Back to Search
Start Over
Deriving Logical Relations from Interpretations of Predicate Logic
- Source :
- MFPS
- Publication Year :
- 2019
- Publisher :
- Elsevier BV, 2019.
-
Abstract
- This paper extends the results of Hermida's thesis about logical predicates to more general logical relations and a wider collection of types. The extension of type constructors from types to logical relations is derived from an interpretation of those constructors on a model of predicate logic. This is then further extended to n-ary relations by pullback. Hermida's theory shows how right adjoints in the category of fibrations are composed from a combination of Cartesian lifting and a local adjunction. This result is generalised to make it more applicable to left adjoints, and then shown to be stable under pullback, deriving an account of n-ary relations from standard predicate logic. A brief discussion of lifting monads to predicates includes the existence of an initial such lifting, generalising existing results.
- Subjects :
- Predicate logic
Interpretation (logic)
General Computer Science
Computer science
020207 software engineering
0102 computer and information sciences
02 engineering and technology
Pullback (category theory)
Extension (predicate logic)
Type (model theory)
Monad (functional programming)
Adjunction
01 natural sciences
Predicate (grammar)
Theoretical Computer Science
Logical relations
Algebra
TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES
010201 computation theory & mathematics
TheoryofComputation_LOGICSANDMEANINGSOFPROGRAMS
Mathematics::Category Theory
Computer Science::Logic in Computer Science
0202 electrical engineering, electronic engineering, information engineering
Computer Science::Programming Languages
Subjects
Details
- ISSN :
- 15710661
- Volume :
- 347
- Database :
- OpenAIRE
- Journal :
- Electronic Notes in Theoretical Computer Science
- Accession number :
- edsair.doi...........5fc1bcc398c6ffc18dbe794a64a31f62