Generality of proofs and its Brauerian representation
نویسندگان
چکیده
The generality of a derivation is an equivalence relation on the set of occurrences of variables in its premises and conclusion such that two occurrences of the same variable are in this relation if and only if they must remain occurrences of the same variable in every generalization of the derivation. The variables in question are propositional or of another type. A generalization of the derivation consists in diversifying variables without changing the rules of inference. This paper examines in the setting of categorial proof theory the conjecture that two derivations with the same premises and conclusions stand for the same proof if and only if they have the same generality. For that purpose generality is defined within a category of equivalence relations on finite ordinals, where composition is rather complicated. Several examples are given of deductive systems of derivations covering fragments of logic, with the associated map into the category of equivalence relations of generality. This category is isomorphically represented in the category of binary relations on finite ordinals, where composition is the usual simple composition of relations. This representation is related to a classical representation result of Richard Brauer. Mathematics Subject Classification (2000): 03F07, 03G30, 18A15, 16G99
منابع مشابه
Proof Abstraction for Imperative Languages
Modularity in programming language semantics derives from abstracting over the structure of underlying denotations, yielding semantic descriptions that are more abstract and reusable. One such semantic framework is Liang’s modular monadic semantics in which the underlying semantic structure is encapsulated with a monad. Such abstraction can be at odds with program verification, however, because...
متن کاملSnap: A Validator=Annotator for Proofs of Distributed Programs
Distributed programs are notorious for subtle errors, requiring proofs to establish their correctness. Correctness proofs carried out on paper tend to be error-prone. This paper presents system Snap (Simple Notion of Annotating Proofs) being developed to validate correctness proofs in Linear Time Temporal Logic (LTL). Snap supports forward proofs and can be used either interactively or in batch...
متن کاملA Brauerian representation of split preorders
Split preorders are preordering relations on a domain whose composition is defined in a particular way by splitting the domain into two disjoint subsets. These relations and the associated composition arise in categorial proof theory in connection with coherence theorems. Here split preorders are represented isomorphically in the category whose arrows are binary relations, where composition is ...
متن کاملThe place of hadith and its efficiency in Islamic ethics
The efficacies of hadith in Islamic ethics is concerned with the authenticity and inauthenticity of ethical hadiths. The authenticity of ethical ahadith is deeply connected to the problem of tolerance in the proofs of sunan which has led to the two views of tolerance and intolerance. In this paper, it has been argued that ethics and jurisprudence are two distinct fields and one can not agree wi...
متن کاملEmbedding a Language with Certified Size Constraints in a Dependently Typed Metalanguage
This paper studies the problem of constructing formal bounds on program resource usage and other complex properties. We use fullspectrum dependent types to embed a language of terms, RAFL, with resource usage properties and associated correctness proofs. Since these properties and associated proofs are directly expressed inRAFL through a formal logic, it follows that correctly specified resourc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Symb. Log.
دوره 68 شماره
صفحات -
تاریخ انتشار 2003