A Meta-Logic of Inference Rules: Syntax
نویسنده
چکیده
This work was intended to be an attempt to introduce the metalanguage for working with multiple-conclusion inference rules that admit asserted propositions along with the rejected propositions. The presence of rejected propositions, and especially the presence of the rule of reverse substitution, requires certain change the definition of structurality.
منابع مشابه
Applications of Proof Theory to Isabelle
Isabelle [3, 4] is a generic theorem prover. It suppports interactive proof in several formal systems, including first-order logic (intuitionistic and classical), higher-order logic, Martin-Löf type theory, and Zermelo-Fraenkel set theory. New logics can be introduced by specifying their syntax and rules of inference. Both natural deduction and sequent calculi are allowed. Isabelle’s approach i...
متن کاملElf: A Meta-Language for Deductive Systems (System Descrition)
1 Overview Elf is a uniform metalanguage for the formalization of the theory of programming languages and logics. It provides means for 1. specifying the abstract syntax and semantics of an object language in a natural and direct way; 2. implementing related algorithms (e.g., for type inference, evaluation, or proof search); and 3. representing proofs of meta-theorems about an object language, ...
متن کاملElf: A Meta-Language for Deductive Systems
Its conceptual basis are deductive systems which are used pervasively in the study of logic and the theory of programming languages. Logics and type systems for programming languages, for example, are often specified via inference rules. Structured operational semantics and natural semantics also employ deductive systems, and other means for semantic specification (for example, by rewrite rules...
متن کاملA Meta-logical Approach for Reasoning with Ontologies and Rules Expressed In OWL 2 VISIT HIRANKITTI and TRANG
OWL is a decidable language for representing ontologies, it adds considerable expressive power to the Semantic Web. However, it has several shortcomings in relational expressivity. These limitations can be overcome by extending an OWL ontology with some form of rules. The revision 2 of OWL is much richer than its predecessor with respect to modeling with rules. In this paper we propose a framew...
متن کاملA Logic for Reasoning with Higher-Order Abstract Syntax
Logical frameworks based on intuitionistic or linear logics with higher-type quantification have been successfully used to give high-level, modular, and formal specifications of many important judgments in the area of programming languages and inference systems. Given such specifications, it is natural to consider proving properties about the specified systems in the framework: for example, giv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1411.7516 شماره
صفحات -
تاریخ انتشار 2014