This post first appeared on Postlib.com.
An updated, more general, abstraction of the concept originally introduced in the section below.
A logical module defined. (More abstract, more fully general, newer, definition.)
A logical interface defined.
Given two languages L₁, L₂ sharing the same proof system S :
i.
Each symbol in L₁ is in L₂.
ii.
Each symbol in L₂ is in L₁.
iii.
The grammar system defining wff in m is in L₁.
iv.
The grammar system defining wff in m is in L₂.
i.
Each symbol in L₁ is in L₂.
ii.
The grammar system defining wff in m is in L₁.
iii.
The grammar system defining wff in m is in L₂.
We assume a logical module or grammatical fragment suitable for first and higher-order implementations. More precisely, I define a [specific] module m per the following:
i.
Where ¬wff is a well-formed formula.
ii.
Where ●( λa , λb ) is a well-formed formula.
iii.
Where ●( λa ) is a well-formed formula.
iv.
where λa, λb range over conceptual variables.
v.
Where wff @ ta is a well-formed formula where ta ranges over temporal operators.
A module m is implemented by a language L whenever:
The syntactic marks negation operator, conceptual variables, belief operator, temporal operators, and time indexing operator are in L's vocabulary.
The grammatical rules above are consistent with and part of L's grammar.
I define plug and play with respect to a language L as an attribute of a module whenever it, the module, can satisfy the two conditions (immediately preceding this one) with respect to L.
Tertiary bits (no pun):
A module
m
interfaces whenever it is implemented by two languagesL₁
,L₂
.
Usually we think of this as a morphism (a kind of relation) between two languages. I’d prefer to focus on the module here.