Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

This book is a monograph on the topic of Proof-Theoretic Semantics, a theory of meaning constituting an alternative to the more traditional Model-Theoretic Semantics. The latter regards meaning as truth-conditions (in arbitrary models), the former regards meaning as canonical derivability conditions in a meaning-conferring natural-deduction proof-system. In the first part of the book, the Proof-Theoretic Semantics for logic is presented. It surveys the way a natural-deduction system can serve as meaning-conferring, and in particular analyses various criteria such a system has to meet in order to qualify as meaning-conferring. A central criterion is harmony, a balance between introduction-rules and elimination-rules. The theory is applied to various logics, e.g., relevance logic, and various proof systems such as multi-conclusion natural-deduction and bilateralism. The presentation is inspired by recent work by the author, and also surveys recent developments. In part two, the theory is applied to fragments of natural language, both extensional and intensional, a development based on the author's recent work. For example, conservativity of determiners, once set up in a proof-theoretic framework, becomes a provable property of all (regular) determiners. It is shown that meaning need not carry the heavy ontological load characteristic of Model-Theoretic Semantics of complex natural language constructs. Nissim Francez is an emeritus professor of computer science at the Technion, Israel Institute of Technology. At a certain point in his career he moved from research related to concurrent and distributed programming and program verification to research in computational linguistics, mainly formal semantics of natural language. In recent years, he has worked on Proof-Theoretic Semantics, in particular for natural language.

Logic, symbolic and mathematical --- Proof theory --- Semantics

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

The study of NIP theories has received much attention from model theorists in the last decade, fuelled by applications to o-minimal structures and valued fields. This book, the first to be written on NIP theories, is an introduction to the subject that will appeal to anyone interested in model theory: graduate students and researchers in the field, as well as those in nearby areas such as combinatorics and algebraic geometry. Without dwelling on any one particular topic, it covers all of the basic notions and gives the reader the tools needed to pursue research in this area. An effort has been made in each chapter to give a concise and elegant path to the main results and to stress the most useful ideas. Particular emphasis is put on honest definitions, handling of indiscernible sequences and measures. The relevant material from other fields of mathematics is made accessible to the logician.

Model theory. --- Independence (Mathematics) --- Logic, Symbolic and mathematical.

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Arithmetic --- Logic, Symbolic and mathematical. --- Philosophy. --- Frege, Gottlob,

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

This book is a collection of chapters, concerning the developments within the Fuzzy Logic field of study. The book includes scholarly contributions by various authors pertinent to Fuzzy Logic. Each contribution comes as a separate chapter complete in itself but directly related to the books topics and objectives. The target audience comprises scholars and specialists in the field.

Fuzzy logic. --- Nonlinear logic --- Fuzzy mathematics --- Logic, Symbolic and mathematical --- Fuzzy systems --- Neural networks & fuzzy systems

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

This monograph presents recursion theory from a generalized point of view centered on the computational aspects of definability. A major theme is the study of the structures of degrees arising from two key notions of reducibility, the Turing degrees and the hyperdegrees, using techniques and ideas from recursion theory, hyperarithmetic theory, and descriptive set theory. The emphasis is on the interplay between recursion theory and set theory, anchored on the notion of definability. The monograph covers a number of fundamental results in hyperarithmetic theory as well as some recent results on the structure theory of Turing and hyperdegrees. It also features a chapter on the applications of these investigations to higher randomness.

Recursion theory. --- Logic, Symbolic and mathematical --- Higher Randomness. --- Hyperdegrees. --- Jump Operator. --- Recursion Theory. --- Turing Degrees.