Listing 1 - 8 of 8 |
Sort by
|
Choose an application
Model theory --- Modeles [Theorie des ] --- Modellentheorie --- Stabiliteit --- Stability --- Stabilité --- Mathematics
Choose an application
Formal languages --- Model theory --- Langages formels --- Théorie des modèles --- Théorie des modèles
Choose an application
Sweet describes the pragmatic foundations of standard logic and applies these foundations to the task of developing a theory of intended models as an extension of standard model theory in which the relevant ";intending"; is represented pragmatically. Methods of formal logic are used to investigate the structure of the relation between language and the world. The truism which holds that this relation includes the speaker as well as the object spoken about is formally explicated and applied to the problem of illuminating one of the deepest phenomena in standard model theory: the existence of non-isomorphic models of complete theories. To this end it is shown that standard logic admits pragmatic foundations upon which a theory of intended models can be built as an extension of standard model theory. The relevant ";intending"; is represented by the very forms of verbal behavior which determine the grammatical and logical structure of the sentences whose referential meaning is in question. The uniqueness properties of the class of intended models may then be described.The first section of the book states the immediate goal of standard pragmatics as that of recovering the algebraic structure first-order logic by means of a purely pragmatic construction. The second section, the major portion of the work, then provides the foundation for a semiotic theory of intended models and referential meaning. The theory is then applied to the problem of referential indeterminancy, which has been associated with the phenomenon of scientific revolutions. The theory is also applied to the problem of the apparent synonymy of observationally equivalent theories. Sweet concludes that such theories are not referentially synonymous in any natural sense which is analogous to the paradigm sense in which theories of alternative scales of measurement are referentially synonymous.A novel feature of this book is the formal explication of the idea that the factors, pragmatical in nature, which distinguish the actual meaning of a sentence from among its possible meanings, whose range is defined by the manner in which the sentence is parsed, determine that very parsing. Applicability to natural language of the model-theoretic semantics thereby obtained is made possible by another feature of the book: the development of a theory of locally standard grammar which provides the foundation for representing the structure of natural language as that of standard first-order logic, in a local, as distinguished from a global, sense.This book is intended for scholars in logic, semiotics, and the philosophies of language and of science. Those concerned specifically with such philosophers as Peirce, Martin, and Davidson will also find the study valuable.
Semiotics. --- Logic, Symbolic and mathematical. --- Semantics (Philosophy) --- Pragmatics. --- Model theory. --- Language and logic.
Choose an application
In recent years the interplay between model theory and other branches of mathematics has led to many deep and intriguing results. In this, the first book on the topic, the theme is the interplay between model theory and the theory of modules. The book is intended to be a self-contained introduction to the subject and introduces the requisite model theory and module theory as it is needed. Dr Prest develops the basic ideas concerning what can be said about modules using the information which may be expressed in a first-order language. Later chapters discuss stability-theoretic aspects of modules, and structure and classification theorems over various types of rings and for certain classes of modules. Both algebraists and logicians will enjoy this account of an area in which algebra and model theory interact in a significant way. The book includes numerous examples and exercises and consequently will make an ideal introduction for graduate students coming to this subject for the first time.
Model theory. --- Modules (Algebra) --- Finite number systems --- Modular systems (Algebra) --- Algebra --- Finite groups --- Rings (Algebra) --- Logic, Symbolic and mathematical
Choose an application
Model theory --- Modules (Algebra) --- Ordered algebraic structures --- Category theory. Homological algebra --- 512.55 --- Finite number systems --- Modular systems (Algebra) --- Algebra --- Finite groups --- Rings (Algebra) --- Logic, Symbolic and mathematical --- 512.55 Rings and modules --- Rings and modules
Choose an application
This textbook is an introduction to non-standard analysis and to its many applications. Non standard analysis (NSA) is a subject of great research interest both in its own right and as a tool for answering questions in subjects such as functional analysis, probability, mathematical physics and topology. The book arises from a conference held in July 1986 at the University of Hull which was designed to provide both an introduction to the subject through introductory lectures, and surveys of the state of research. The first part of the book is devoted to the introductory lectures and the second part consists of presentations of applications of NSA to dynamical systems, topology, automata and orderings on words, the non- linear Boltzmann equation and integration on non-standard hulls of vector lattices. One of the book's attractions is that a standard notation is used throughout so the underlying theory is easily applied in a number of different settings. Consequently this book will be ideal for graduate students and research mathematicians coming to the subject for the first time and it will provide an attractive and stimulating account of the subject.
Nonstandard mathematical analysis --- Mathematics --- Congresses. --- Mathematical analysis --- Mathematical analysis [Nonstandard ] --- Congresses --- Mathematical analysis, Nonstandard - Congresses. --- Analysis, Nonstandard mathematical --- Mathematical analysis, Nonstandard --- Non-standard analysis --- Nonstandard analysis --- Model theory --- Nonstandard mathematical analysis - Congresses
Choose an application
This volume contains the 13 best of the 18 papers presented at the first MFDBS conference held in Dresden, GDR, January 19-23, 1987. A short summary of the two panel discussions is also included. The volume is intended to be a reflection of the current state of knowledge and a guide to further development in database theory. The main topics covered are: theoretical fundaments of the relational data model (dependency theory, design theory, null values, query processing, complexity theory), and of its extensions (graphical representations, NF2-models), conceptual modelling of distributed database management systems and the relationship between logic and databases.
Information systems --- 681.3*H2 --- Database management --- Relational databases --- -681.3*F41 --- 681.3*G21 --- Relational data bases --- Databases --- Data base management --- Data services (Database management) --- Database management services --- DBMS (Computer science) --- Generalized data management systems --- Services, Database management --- Systems, Database management --- Systems, Generalized database management --- Electronic data processing --- Database management: security; integrity; protection--See also {?681.5*E5} --- Mathematical models --- -Congresses. --- Congresses --- Mathematical logic: computability theory; computational logic; lambda calculus; logic programming; mechanical theorem proving; model theory; proof theory;recursive function theory--See also {681.3*F11}; {681.3*I22}; {681.3*I23} --- Combinatorics: combinatorial algorithms; counting problems; generating functions; permutations and combinations; recurrences and difference equations --- Congresses. --- 681.3*G21 Combinatorics: combinatorial algorithms; counting problems; generating functions; permutations and combinations; recurrences and difference equations --- 681.3*F41 Mathematical logic: computability theory; computational logic; lambda calculus; logic programming; mechanical theorem proving; model theory; proof theory;recursive function theory--See also {681.3*F11}; {681.3*I22}; {681.3*I23} --- 681.3*H2 Database management: security; integrity; protection--See also {?681.5*E5} --- 681.3*F41 --- Mathematical models&delete& --- Information theory. --- Data structures (Computer scienc. --- Computer science. --- Theory of Computation. --- Data Structures and Information Theory. --- Models and Principles. --- Informatics --- Science --- Communication theory --- Communication --- Cybernetics --- Databases. --- Data Base --- Relational Model --- Model --- Lncs
Choose an application
This volume is the proceedings of the second International Conference on Database Theory (ICDT) held in Bruges, Belgium, August 31 - September 2, 1988. ICDT intends to provide a European forum for the international research community working on theoretical issues related to database and knowledge base systems. The proceedings of this conference contain all invited and accepted papers, which represent the latest results obtained in ongoing research in database theory worldwide. Most major themes of research in database theory are covered in ICDT '88: the relational model, logic and databases, object-oriented databases, deductive databases, conceptual models, analysis and design of data structures, query languages, concurrency control and updates and transactions.
Information systems --- Bases de données --- Gestion --- 681.3*H2 --- 681.3*E2 --- 681.3*F41 --- 681.3*H20 --- 681.3*I24 --- Database management: security; integrity; protection--See also {?681.5*E5} --- Data storage representations: composite structures; contiguous representations; hash-table representations; linked representations; primitive data items --- Mathematical logic: computability theory; computational logic; lambda calculus; logic programming; mechanical theorem proving; model theory; proof theory;recursive function theory--See also {681.3*F11}; {681.3*I22}; {681.3*I23} --- Computerwetenschap--?*H20 --- Knowledge representation formalisms and methods: frames and scripts; predicate logic; relation systems; representation languages; procedural and rule-based representations; semantic networks (Artificial intelligence) --- 681.3*I24 Knowledge representation formalisms and methods: frames and scripts; predicate logic; relation systems; representation languages; procedural and rule-based representations; semantic networks (Artificial intelligence) --- 681.3*F41 Mathematical logic: computability theory; computational logic; lambda calculus; logic programming; mechanical theorem proving; model theory; proof theory;recursive function theory--See also {681.3*F11}; {681.3*I22}; {681.3*I23} --- 681.3*E2 Data storage representations: composite structures; contiguous representations; hash-table representations; linked representations; primitive data items --- 681.3*H2 Database management: security; integrity; protection--See also {?681.5*E5} --- Data structures (Computer scienc. --- Computer science. --- Database management. --- Data Structures and Information Theory. --- Computer Science, general. --- Database Management. --- Models and Principles. --- Data base management --- Data services (Database management) --- Database management services --- DBMS (Computer science) --- Generalized data management systems --- Services, Database management --- Systems, Database management --- Systems, Generalized database management --- Electronic data processing --- Informatics --- Science --- Databases. --- Bases de données - Gestion - Congres
Listing 1 - 8 of 8 |
Sort by
|