paulson [Wed, 11 Sep 1996 18:46:07 +0200] rev 1978
Moved RSLIST here from ../Relation.ML
paulson [Wed, 11 Sep 1996 18:45:33 +0200] rev 1977
Removal of univ_cs
paulson [Wed, 11 Sep 1996 18:40:55 +0200] rev 1976
Reformatting
nipkow [Wed, 11 Sep 1996 18:00:53 +0200] rev 1975
renamed cterm_lift_inst_rule to term_lift_inst_rule and made it take
uncertified things, because they need to be recertified anyway.
nipkow [Wed, 11 Sep 1996 15:17:07 +0200] rev 1974
Removed refs to clasets like rel_cs etc. Used implicit claset.
nipkow [Tue, 10 Sep 1996 20:10:29 +0200] rev 1973
Converted proofs to use default clasets.
paulson [Tue, 10 Sep 1996 11:37:52 +0200] rev 1972
Added Auth to the test target
paulson [Tue, 10 Sep 1996 11:35:23 +0200] rev 1971
Now runs all Auth proofs
paulson [Tue, 10 Sep 1996 11:07:49 +0200] rev 1970
Now uses DB-ROOT.ML, which is separate from ROOT.ML
paulson [Tue, 10 Sep 1996 11:07:16 +0200] rev 1969
Dedicated root file for making the Auth database
paulson [Tue, 10 Sep 1996 10:48:07 +0200] rev 1968
Beefed-up auto-tactic: now repeatedly simplifies if needed
paulson [Mon, 09 Sep 1996 18:58:02 +0200] rev 1967
"bad" set simplifies statements of many theorems
nipkow [Mon, 09 Sep 1996 18:53:41 +0200] rev 1966
added cterm_lift_inst_rule
paulson [Mon, 09 Sep 1996 17:44:20 +0200] rev 1965
Stronger proofs; work for Otway-Rees
paulson [Mon, 09 Sep 1996 17:34:24 +0200] rev 1964
Stronger proofs; work for Otway-Rees
paulson [Mon, 09 Sep 1996 17:33:23 +0200] rev 1963
These simpsets must not use miniscoping
paulson [Mon, 09 Sep 1996 11:08:01 +0200] rev 1962
Corrected associativity: must be to right, as the type dictatess
paulson [Mon, 09 Sep 1996 10:59:32 +0200] rev 1961
Removal of (EX x. P) <-> P and (ALL x. P) <-> P
from ex_simps and all_simps. as they are already in quant_simps.
paulson [Fri, 06 Sep 1996 11:56:12 +0200] rev 1960
Improved error handling: if there are syntax or type-checking
errors, prints the name of the offending axiom
paulson [Fri, 06 Sep 1996 10:45:48 +0200] rev 1959
Modified proof to work with miniscoping
paulson [Thu, 05 Sep 1996 18:42:48 +0200] rev 1958
Now uses thin_tac
paulson [Thu, 05 Sep 1996 18:31:14 +0200] rev 1957
Now uses thin_tac
paulson [Thu, 05 Sep 1996 18:30:13 +0200] rev 1956
Renaming of _rews to _simps
paulson [Thu, 05 Sep 1996 18:29:43 +0200] rev 1955
Added thin_tac to signature; previous change was useless
paulson [Thu, 05 Sep 1996 18:28:54 +0200] rev 1954
Some renaming. Note that this miniscoping is more
general than that of ../simpdata.ML, as distributive laws are included.
On this other hand this version is for NNF only.
paulson [Thu, 05 Sep 1996 18:28:01 +0200] rev 1953
Introduction of miniscoping for FOL
paulson [Thu, 05 Sep 1996 10:30:42 +0200] rev 1952
Pretty-printing change to emphasize the scope of assumptions
paulson [Thu, 05 Sep 1996 10:29:52 +0200] rev 1951
Declared thin_tac
paulson [Thu, 05 Sep 1996 10:29:20 +0200] rev 1950
Miniscoping rules are deleted, as these brittle proofs
would otherwise have to be entirely redone
paulson [Thu, 05 Sep 1996 10:27:36 +0200] rev 1949
Simplified some proofs for compatibility with miniscoping
paulson [Thu, 05 Sep 1996 10:23:55 +0200] rev 1948
Added miniscoping to the simplifier: quantifiers are now pushed in
paulson [Tue, 03 Sep 1996 19:07:23 +0200] rev 1947
Fixed pretty-printing of {|...|}
paulson [Tue, 03 Sep 1996 19:07:00 +0200] rev 1946
New theorems for Fake case
paulson [Tue, 03 Sep 1996 19:06:00 +0200] rev 1945
A further tidying
paulson [Tue, 03 Sep 1996 18:30:15 +0200] rev 1944
ROOT file for Auth directory
paulson [Tue, 03 Sep 1996 18:24:42 +0200] rev 1943
Renaming and simplification
paulson [Tue, 03 Sep 1996 17:54:39 +0200] rev 1942
Renaming and simplification
paulson [Tue, 03 Sep 1996 16:43:31 +0200] rev 1941
Initial working proof of Otway-Rees protocol
nipkow [Fri, 23 Aug 1996 13:12:51 +0200] rev 1940
Swaped two conditions in the completeness statement.
nipkow [Fri, 23 Aug 1996 13:03:02 +0200] rev 1939
Generalized my_lemma1: (c3,s3) |--> cs3
paulson [Thu, 22 Aug 1996 12:27:01 +0200] rev 1938
Now deepen_tac can take advantage of wrappers --
including addss...
paulson [Thu, 22 Aug 1996 12:24:58 +0200] rev 1937
Proved mem_if
paulson [Thu, 22 Aug 1996 12:24:25 +0200] rev 1936
Proved set_of_list_subset_Cons
paulson [Thu, 22 Aug 1996 12:18:21 +0200] rev 1935
For building the security theory as a separate database
paulson [Wed, 21 Aug 1996 13:25:27 +0200] rev 1934
Separation of theory Event into two parts:
Shared for general shared-key material
NS_Shared for the Needham-Schroeder shared-key protocol
paulson [Wed, 21 Aug 1996 13:22:23 +0200] rev 1933
Addition of message NS5
paulson [Wed, 21 Aug 1996 11:43:37 +0200] rev 1932
Tidying: removing redundant args in classical reasoner calls
paulson [Wed, 21 Aug 1996 11:00:04 +0200] rev 1931
Added le_eq_less_Suc; fixed some comments;
a bit of tidying up
paulson [Tue, 20 Aug 1996 18:53:17 +0200] rev 1930
Working version of NS, messages 1-4!
paulson [Tue, 20 Aug 1996 17:46:24 +0200] rev 1929
Working version of NS, messages 1-3, WITH INTERLEAVING
paulson [Tue, 20 Aug 1996 12:40:17 +0200] rev 1928
Added ref to allow suppression of error msgs
paulson [Tue, 20 Aug 1996 12:39:30 +0200] rev 1927
New classical reasoner: warns of, and ignores, redundant rules.
Also warns of rules supplied with different "hints" (Safe, etc.)
paulson [Tue, 20 Aug 1996 12:36:58 +0200] rev 1926
Addition of function set_of_list
paulson [Tue, 20 Aug 1996 12:32:16 +0200] rev 1925
Some tidying. This brittle proof depends upon
AddSEs [less_SucE];
paulson [Tue, 20 Aug 1996 12:23:13 +0200] rev 1924
Corrected for new classical reasoner: redundant rules
are now ignored, even if this could increase their priority
nipkow [Mon, 19 Aug 1996 15:35:11 +0200] rev 1923
updated html-link
paulson [Mon, 19 Aug 1996 13:06:30 +0200] rev 1922
Installation of auto_tac; re-organization
paulson [Mon, 19 Aug 1996 13:03:17 +0200] rev 1921
Tidied up the proofs
paulson [Mon, 19 Aug 1996 11:51:39 +0200] rev 1920
Added impOfSubs
paulson [Mon, 19 Aug 1996 11:49:31 +0200] rev 1919
Now less_zeroE is a Safe Elim rule