Die Grundlagen gehören zu den klassischen Texten der Sprachphilosophie, Logik und Mathematik. Frege stützt sein Programm einer Begründung von Arithmetik und Analysis auf reine Logik, indem er die natürlichen Zahlen als bestimmte Begriffsumfänge definiert. Die philosophische Fundierung des Fregeschen Ansatzes bilden erkenntnistheoretische und sprachphilosophische Analysen und Begriffserklärungen. Studienausgabe aufgrund der textkritisch herausgegebenen Jubiläumsausgabe (Centenarausgabe). Mit Einleitung, Anmerkungen, Literaturverzeichnis und Namenregister.

A new semantics is presented for the logic of proofs (LP), [1, 2], based on the intuition that it is a logic of explicit knowledge. This semantics is used to give new proofs of several basic results concerning LP. In particular, the realization of S4 into LP is established in a way that carefully examines and explicates the role of the + operator. Finally connections are made with the conventional approach, via soundness and completeness results.

A propositional logic of explicit proofs, LP, was introduced in [S. Artemov, Explicit provability and constructive semantics, The Bulletin for Symbolic Logic 7 1–36], completing a project begun long ago by Gödel, [K. Gödel, Vortrag bei Zilsel, translated as Lecture at Zilsel’s in: S. Feferman , Kurt Gödel Collected Works III, 1938, pp. 62–113]. In fact, LP can be looked at in a more general way, as a logic of explicit evidence, and there have been several papers along these lines. (...) A major result about LP is the Realization Theorem, that says any theorem of S4 can be converted into a theorem of LP by some replacement of necessitation symbols with explicit proof terms. Thus the necessitation operator of S4 can be seen as a kind of implicit existential quantifier: there exists a proof term such that…. In this paper, quantification over evidence is introduced into LP, and it is shown that the connection between S4 necessitation and the existential quantifier becomes an explicit one. The extension of LP with quantifiers is called QLP. A semantics and an axiom system for QLP are given, soundness and completeness are established, and several results are proved relating QLP to LP and to S4. (shrink)

Since the early 1980s, logical theories of belief revision have offered formal methods for the transformation of knowledge bases or “corpora” of data and beliefs. Early models have dealt with unconditional acceptance and integration of potentially belief-contravening pieces of information into the existing corpus. More recently, models of “non-prioritized” revision were proposed that allow the agent rationally to refuse to accept the new information. This paper introduces a refined method for changing beliefs by specifying constraints on the relative plausibility of (...) propositions. Like the earlier belief revision models, the method proposed is a qualitative one, in the sense that no numbers are needed in order to specify the posterior plausibility of the new information. We use reference beliefs in order to determine the degree of entrenchment of the newly accepted piece of information. We provide two kinds of semantics for this idea, give a logical characterization of the new model, study its relation with other operations of belief revision and contraction, and discuss its intuitive strengths and weaknesses. (shrink)

In recent papers [10, 11] Krister Segerberg introduced Irrevocable Belief Revision, as closely related to AGM revision [2]. In this paper we present irrevocable belief revision in terms of an epistemic entrenchment relation.

One of the ways to model contraction functions for belief sets is epistemic entrenchment. The first step was provided by Gärdenfors in [5], who defined epistemic entrenchment and a contraction function in terms of it and related the latter with the AGM contraction function. Later Hans Rott in [16] presented an entrenchment based contraction function that does not satisfy recovery. In this paper we provide an axiomatic characterization of Rott Contraction.

In this paper we present some concepts and their relations that are necessary for modeling autonomous agents in an environment that is governed by some (social) norms. We divide the norms over three levels: the private level the contract level and the convention level. We show how deontic logic can be used to model the concepts and how the theory of speech acts can be used to model the generation of (some of) the norms. Finally we give some idea about (...) an agent architecture incorporating the social norms based on a BDI framework. (shrink)

Some results on the upper end of the lattice of all modal propositional logics.

We show in this paper that the AGM postulates are too weak to ensure the rational preservation of conditional beliefs during belief revision, thus permitting improper responses to sequences of observations. We remedy this weakness by proposing four additional postulates, which are sound relative to a qualitative version of probabilistic conditioning. Contrary to the AGM framework, the proposed postulates characterize belief revision as a process which may depend on elements of an epistemic state that are not necessarily captured by a (...) belief set. We also show that a simple modification to the AGM framework can allow belief revision to be a function of epistemic states. We establish a model-based representation theorem which characterizes the proposed postulates and constrains, in turn, the way in which entrenchment orderings may be transformed under iterated belief revision. (shrink)

This paper introduces new logical systems which axiomatize a formal representation of inconsistency (here taken to be equivalent to contradictoriness) in classical logic. We start from an intuitive semantical account of inconsistent data, fixing some basic requirements, and provide two distinct sound and complete axiomatics for such semantics, LFI1 and LFI2, as well as their first-order extensions, LFI1* and LFI2*, depending on which additional requirements are considered. These formal systems are examples of what we dub Logics of Formal Inconsistency (LFI) (...) and form part of a much larger family of similar logics. We also show that there are translations from classical and paraconsistent first-order logics into LFI1* and LFI2*, and back. Hence, despite their status as subsystems of classical logic, LFI1* and LFI2* can codify any classical or paraconsistent reasoning. (shrink)

We describe a model of iterated belief revision that extends the AGM theory of revision to account for the effect of a revision on the conditional beliefs of an agent. In particular, this model ensures that an agent makes as few changes as possible to the conditional component of its belief set. Adopting the Ramsey test, minimal conditional revision provides acceptance conditions for arbitrary right-nested conditionals. We show that problem of determining acceptance of any such nested conditional can be reduced (...) to acceptance tests for unnested conditionals. Thus, iterated revision can be accomplished in a "virtual" manner, using uniterated revision. (shrink)

Modal logics are studied in their algebraic disguise of varieties of so-called modal algebras. This enables us to apply strong results of a universal algebraic nature, notably those obtained by B. Jonsson. It is shown that the degree of incompleteness with respect to Kripke semantics of any modal logic containing the axiom □ p → p or containing an axiom of the form $\square^mp \leftrightarrow\square^{m + 1}p$ for some natural number m is 2 ℵ 0 . Furthermore, we show that (...) there exists an immediate predecessor of classical logic (axiomatized by $p \leftrightarrow \square p$ ) which is not characterized by any finite algebra. The existence of modal logics having 2 ℵ 0 immediate predecessors is established. In contrast with these results we prove that the lattice of extensions of S4 behaves much better: a logic extending S4 is characterized by a finite algebra iff it has finitely many extensions and any such logic has only finitely many immediate predecessors, all of which are characterized by a finite algebra. (shrink)

In 1933 Godel introduced a calculus of provability (also known as modal logic S4) and left open the question of its exact intended semantics. In this paper we give a solution to this problem. We find the logic LP of propositions and proofs and show that Godel's provability calculus is nothing but the forgetful projection of LP. This also achieves Godel's objective of defining intuitionistic propositional logic Int via classical proofs and provides a Brouwer-Heyting-Kolmogorov style provability semantics for Int which (...) resisted formalization since the early 1930s. LP may be regarded as a unified underlying structure for intuitionistic, modal logics, typed combinatory logic and λ-calculus. (shrink)

A study in the logic of theory change, examining the properties of maxichoice contraction and revision operations.

Until not too many years ago, all logics except classical logic (and, perhaps, intuitionistic logic too) were considered to be things esoteric. Today this state of a airs seems to have completely been changed. There is a growing interest in many types of nonclassical logics: modal and temporal logics, substructural logics, paraconsistent logics, non-monotonic logics { the list is long. The diversity of systems that have been proposed and studied is so great that a need is felt by many researchers (...) to try to put some order in the present logical jungle. Thus Cl91], Ep90] and Wo88] are three recent books in which an attempt is made to develop a general theoretical framework for the study of logics. On the more pragmatic side, several systems have been developed with the goal of providing a computerized logical framework in which many di erent logical systems can be implemented in a uniform way. An example is the Edinburgh LF( HHP91]). (shrink)

"This book is valuable as expounding in full a theory of meaning that has its roots in the work of Frege and has been of the widest influence.

Elementary set theory accustoms the students to mathematical abstraction, includes the standard constructions of relations, functions, and orderings, and leads to a discussion of the various orders of infinity. The material on logic covers not only the standard statement logic and first-order predicate logic but includes an introduction to formal systems, axiomatization, and model theory. The section on algebra is presented with an emphasis on lattices as well as Boolean and Heyting algebras. Background for recent research in natural language semantics (...) includes sections on lambda-abstraction and generalized quantifiers. Chapters on automata theory and formal languages contain a discussion of languages between context-free and context-sensitive and form the background for much current work in syntactic theory and computational linguistics. The many exercises not only reinforce basic skills but offer an entry to linguistic applications of mathematical concepts. For upper-level undergraduate students and graduate students in theoretical linguistics, computer-science students with interests in computational linguistics, logic programming and artificial intelligence, mathematicians and logicians with interests in linguistics and the semantics of natural language. (shrink)

In the middle of the 1980s, logical tools were discovered that make it possible to model changes in belief and knowledge in entirely new ways. These logical tools turned out to be applicable both to human beliefs and to the contents of databases. This is the first textbook in this new area. It contains both discursive chapters with a minimum of formalism and formal chapters in which proofs and proof methods are presented. By using different selections from the formal section (...) the book can be used on all levels of University education. (shrink)

This book presents a formal and philosophical analysis of language syntax. It refers to some ideas of E.Husserl and G. Frege, to S. Leśniewski's theory of syntactic categories and K. Ajdukiewicz's conception of formal grammar, also to Ch.S. Pierces's distinction between tokens (concrete linguistic entities) and types (ideal linguistic entities) and to A.A. Markov's theory of algorithms. The central aim of the book is - in the spirit of these ideas - to provide both strict yet comprehensive lectures on two (...) axiomatic theories of languages (grammars) irrespective of specific structure of their expression and the notation used in them. The main feature of these theories are that definitions of well-formed expression allow the formulation of algorithms for the examination of syntactic correctness of expressions and that their formalizations are bi-level, in reference to opposite philosophical orientations: nominalistic and idealistic. The theoretical considerations in the book speak in favour of the former. The book contains a translation of the basic contents of the book in Polish "Teorie języków syntaktycznie kategorialnych ("Theories of syntactically categorial languages"), PWN, Warszawa-Wrocław 1985, and extensive Introduction and Final Remarks. In Introduction are discussed the main assumptions, objectives and conditionings of presented theories and intuitive foundations of these theories. Final Remarks are connected with the subject-matter of the book and the ability to build syntax theories in the opposition spirit, because of the Platonic approach to language syntax. -/- . (shrink)

The 'Evolution of Cooperation' addresses a simple yet age-old question; If living things evolve through competition, how can cooperation ever emerge? Despite the abundant evidence of cooperation all around us, there existed no purely naturalistic answer to this question until 1979, when Robert Axelrod famously ran a computer tournament featuring a standard game-theory exercise called The Prisoner's Dilemma. To everyone's surprise, the program that won the tournament, named Tit for Tat, was not only the simplest but the most "cooperative" entrant. (...) This unexpected victory proved that cooperation - one might even say altruism - is mathematically possible and therefore needs no hidden hand or divine agent to create and sustain it. A great roadblock to the understanding of all sorts of behavior was at last removed. The updated edition includes an extensive new chapter on cooperation in cancer cells and among terrorist organizations. (shrink)

It is well known that every propositional logic which satisfies certain very natural conditions can be characterized semantically using a multi-valued matrix ([Los and Suszko, 1958; W´ ojcicki, 1988; Urquhart, 2001]). However, there are many important decidable logics whose characteristic matrices necessarily consist of an infinite number of truth values. In such a case it might be quite difficult to find any of these matrices, or to use one when it is found. Even in case a logic does have a (...) finite characteristic matrix it might be difficult to discover this fact, or to find such a matrix. The deep reason for these difficulties is that in an ordinary multi-valued semantics the rules and axioms of a system should be considered as a whole, and there is no method for separately determining the semantic effects of each rule alone. (shrink)

Given the fundamental role that concepts play in theories of cognition, philosophers and cognitive scientists have a common interest in concepts. Nonetheless, there is a great deal of controversy regarding what kinds of things concepts are, how they are structured, and how they are acquired. This chapter offers a detailed high-level overview and critical evaluation of the main theories of concepts and their motivations. Taking into account the various challenges that each theory faces, the chapter also presents a novel approach (...) to concepts that is organized around two ideas. The first is a pluralistic view of differing types of conceptual structure. The second is a model that treats concepts as atomic representations that are linked to various types of conceptual structures. (shrink)

Six experiments explored the hypothesis that the members of categories which are considered most prototypical are those with most attributes in common with other members of the category and least attributes in common with other categories. In probabilistic terms, the hypothesis is that prototypicality is a function of the total cue validity of the attributes of items. In Experiments 1 and 3, subjects listed attributes for members of semantic categories which had been previously rated for degree of prototypicality. High positive (...) correlations were obtained between those ratings and the extent of distribution of an item's attributes among the other items of the category. In Experiments 2 and 4, subjects listed superordinates of category members and listed attributes of members of contrasting categories. Negative correlations were obtained between prototypicality and superordinates other than the category in question and between prototypicality and an item's possession of attributes possessed by members of contrasting categories. Experiments 5 and 6 used artificial categories and showed that family resemblance within categories and lack of overlap of elements with contrasting categories were correlated with ease of learning, reaction time in identifying an item after learning, and rating of prototypicality of an item. It is argued that family resemblance offers an alternative to criterial features in defining categories. (shrink)