Introduction to Metalogic
نویسنده
چکیده
Definition. A propositional signature Σ is a collection of items, which we call propositional constants. Sometimes these propositional constants are also called elementary sentences, or even atomic sentences. However, we will be using the word “atomic” for a different concept. These propositional constants are assumed to have no independent meaning. Nonetheless, we assume a primitive notion of identity between propositional constants; the fact that two propositional constants are equal or non-equal is not explained by any more fundamental fact. This assumption is tantamount to saying that Σ is a bare set (and it stands in gross violation of Leibniz’s principle of the identity of indiscernibles).
منابع مشابه
Mental metalogic and its empirical justifications: The case of reasoning with quantifiers and predicates
We report on a series of experiments designed to test a new, unifying theory in psychology of deductive reasoning: mental metalogic (MML, for short; Yang & Bringsjord, 2001), which marks the unification of mental logic (ML) and mental model (MM) theory, and stands in part on the strength of empirical investigation of strategic interactions between logical syntactic and logical semantic processe...
متن کاملInductive Metalogic Programming 1
We propose a metalogic programming method for eecient induction of a fairly large class of list-handling logic programs delineated through restrictions on the hypothesis language. These restrictions take the form of predeened program recursion schemes (higher order \clich es") from which the hypotheses programs in the induction process are derived by plugging in either simple, nonrecursive clau...
متن کاملFactoring an Adequacy Proof (Preliminary Version)
This paper contributes to the methodology of using metalogics for reasoning about programming languages. As a concrete example we consider a fragment of ML corresponding to call-by-value PCF and translate it into a metalogic which contains (amongst other types) computation types and a fixpoint type. The main result is a soundness property (?): if the denotations of two programs are provably equ...
متن کاملAn Equational Metalogic for Monadic Equational Systems
The paper presents algebraic and logical developments. From the algebraic viewpoint, we introduce Monadic Equational Systems as an abstract enriched notion of equational presentation. From the logical viewpoint, we provide Equational Metalogic as a general formal deductive system for the derivability of equational consequences. Relating the two, a canonical model theory for Monadic Equational S...
متن کاملQuerying Class-Relationship Logic in a Metalogic Framework
We introduce a class relationship logic for stating various forms of logical relationships between classes. This logic is intended for ontologies and knowledge bases and combinations thereof. Reasoning and querying is conducted in the Datalog logical language, which serves as an embracing decidable and tractable metalogic.
متن کاملFlexible Query-Answering Systems Modelled in Metalogic Programming
Metaprogramming adds new expressive power to logic programming which can be advantageous to transfer to the field of deductive databases. We propose metaprogramming as a way to model and develop new, flexible query-answering systems. A model is shown, extending deductive databases by a classification of the clauses in the database, an integration of nonstandard inference rules, and a notion of ...
متن کامل