On ‘Logical Relations’ in Program Semantics

Boris A. Trakhtenbrot
Additional contact information
Boris A. Trakhtenbrot: Tel-Aviv University, MIT Lab. for Computer Science

A chapter in Mathematical Logic and Its Applications, 1987, pp 213-229 from Springer

Abstract: Abstract The simplest way to think about logical relations and invariance is to start with permutations on a ‘ground’ set D; a permutation m1 is obviously lifted to a permutation m2 on functionals F from D into D by $${m_2}F = {m_1} \cdot F \cdot {\left( {{m_1}} \right)^{ - 1}}$$ and this process can be performed for all higher types as well. Then a functional G (of some type) is invariant with respect to a class M of permutations iff mG = G for all m in M.

Keywords: Fundamental Theorem; Logical Relation; Characterization Theorem; Ground Type; Partial Correctness (search for similar items in EconPapers)
Date: 1987
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4613-0897-3_14

Ordering information: This item can be ordered from
http://www.springer.com/9781461308973

DOI: 10.1007/978-1-4613-0897-3_14

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().