Axiomatization of Legal Contracts

A legal contract is a set of axioms we will call { } { } over a set of people, who will sign the contract , and a legal contract if it has the following properties:

1. Language: There must exists some set S, a finite number k, and a language which is a subset of the set of k length vectors , such that all of the axioms can be represented as one of those vectors. [ ] 2. Format: If possible, the contract will only contain mathematical and logical symbols, and computer code loops (in a language that the sides agreed on earlier, which satisfies the Language Axiom). 3. Validity: Every one of the axioms must be well defined, meaning that it must have one meaning only: [ ] ( ) [{ } ]
[{ } ]

[ ]

[ ]

4. Proof: There must be at least one page of the legal contract, in which a valid proof is given for all of the axioms. If there isnt a proof for a certain axiom, then it will be removed from the contract. This proof can be probabilistic. { } is a set of tautologies and logical statements, which have a probability of over 75% of being correct. C is a case (which can be represented as a set of terms). [ ] { } ( [ ] ) ( )

5. Covers all Probable Cases and gives an Algorithm of Action for these cases: Every case that could happen with a probability of over 75% must be mentioned. There must be an algorithm of action (in particular punishments for the people for not being consistent with the axioms), in the form of an if or while loop for all of the cases with a probability of over 75%. { }
if (C) // while (C) { for (int i=1; i<L; i++) { S_i; } }

6. Updating Frequency and Time: The frequency and cases in which the contract will be updated must be specified. { } [ ]

Noy Soffer 2013

for (C) { for (int i=1; i<=N; i++) { if (a_i(C)==true) { The contract will be re-evaluated and updated; } } } if (present_time==time(LastUpdate)+T) { The contract will be re-evaluated and updated; }

Noy Soffer 2013