id	author	title	date	pages	extension	mime	words	sentences	flesch	summary	cache	txt
work_k2emhnwdtncdzkzdohs3b4cg5e	John Corcoran	Three Logical Theories	1969	27	.pdf	application/pdf	12967	960	66	will codify schemas or sentence forms all of whose instances are logically true Here a rule is SOUND if its conclusions follow logically from its premises. An "ideal" logistic system is also complete (codifies all logically true sentences) and Post complete (so complete that properly new axioms can not be added). rules of inference by which the logical consequences of a given set of sentences are Needless to say the rules of inference must always produce from a given set of sentences only logical consequences of it. same logically true sentences of L as codified by LS and (2) the valid arguments of L logical truths, valid arguments and (sound, rigorous) proofs. In general, a deductive system codifies logical truths, valid arguments and sound, A rule of inference is rigorous iff (1) it is effective, (2) it is sound, (3) it introduces or eliminates exactly one occurrence of a logical symbol (and not both), 	./cache/work_k2emhnwdtncdzkzdohs3b4cg5e.pdf	./txt/work_k2emhnwdtncdzkzdohs3b4cg5e.txt