Realization of many-sorted terms #
A term has a value in a structure, given the values of its variables, and the value of a substituted term is the value of the term at the values of what was substituted. A relation between the domains of two structures that every function respects holds between the two values of every term.
Main definitions #
ManySorted.Language.Term.realize: the value of a term in a structure.ManySorted.Signature.Place.val: the argument at a place.ManySorted.Signature.LiftRel: a relation between two families of domains, between the arguments of a shape.ManySorted.Language.Structure.IsLogicalRel: a relation between the domains of two structures that every function respects.
The argument at a place, among the arguments of a shape.
Equations
Instances For
A relation between two families of domains holds between the arguments of a shape when it holds between them place by place.
Equations
- ManySorted.Signature.LiftRel R ManySorted.Signature.nil x_3 x_4 = True
- ManySorted.Signature.LiftRel R (ManySorted.Signature.of s) a b = R s a b
- ManySorted.Signature.LiftRel R (σ.prod τ) a b = (ManySorted.Signature.LiftRel R σ a.fst b.fst ∧ ManySorted.Signature.LiftRel R τ a.snd b.snd)
Instances For
The value of a term in a structure, given the values of its variables.
Equations
- ManySorted.Language.Term.realize M ρ (ManySorted.Language.Term.var x_2) = ρ x_2
- ManySorted.Language.Term.realize M ρ (ManySorted.Language.Term.func f r) = ManySorted.Language.Structure.funMap f (ManySorted.Language.Term.realize M (fun {s : S} => ρ) r)
- ManySorted.Language.Term.realize M ρ (a.prod b) = (ManySorted.Language.Term.realize M (fun {s : S} => ρ) a, ManySorted.Language.Term.realize M (fun {s : S} => ρ) b)
- ManySorted.Language.Term.realize M ρ ManySorted.Language.Term.nil = PUnit.unit
Instances For
The term of argument places takes the arguments as its value.
A logical relation between two structures for one language: a relation between their domains that every function respects, taking related arguments to related values.
- funMap {σ : Signature S} {s : S} (f : L.Functions σ s) : Relator.LiftFun (Signature.LiftRel R σ) (R s) (Structure.funMap f) (Structure.funMap f)
Each function takes related arguments to related values.
Instances For
The basic lemma of logical relations: a logical relation holds between the two values of a term whose variables have related values.
Logical relations for two languages make one for their sum.
A relation that the unary and the binary functions respect is a logical relation between two structures for a language of unary and binary symbols.
A logical relation between two structures is one between the structures on values that depend on a parameter, at related values of the parameters.