Quantifiers: Logics, Models and Computation [electronic resource] : Volume Two: Contributions /

This volume contains a collection of research papers centered around the concept of quantifier. Recently this concept has become the central point of research in logic. It is one of the important logical concepts whose exact domain and applications have so far been insufficiently explored, especially in the area of inferential and semantic properties of languages. It should thus remain the central point of research in the future. Moreover, during the last twenty years generalized quantifiers and logical technics based on them have proved their utility in various applications. The example of natu­ rallanguage semantics has been partcularly striking. For a long time it has been belived that elementary logic also called first-order logic was an ade­ quate theory of logical forms of natural language sentences. Recently it has been accepted that semantics of many natural language constructions can­ not be properly represented in elementary logic. It has turned out, however, that they can be described by means of generalized quantifiers. As far as computational applications oflogic are concerned, particulary interesting are semantics restricted to finite models. Under this restriction elementary logic looses several of its advantages such as axiomatizability and compactness. And for various purposes we can use equally well some semantically richer languages of which generalized quantifiers offer the most universal methods of describing extensions of elementary logic. Moreover we can look at generalized quantifiers as an explication of some specific mathematical concepts, e. g.

Saved in:
Bibliographic Details
Main Authors: Krynicki, Michał. editor., Mostowski, Marcin. editor., Szczerba, Lesław W. editor., SpringerLink (Online service)
Format: Texto biblioteca
Language:eng
Published: Dordrecht : Springer Netherlands : Imprint: Springer, 1995
Subjects:Philosophy., Logic., Computers., Mathematical logic., Semantics., Mathematical Logic and Foundations., Theory of Computation.,
Online Access:http://dx.doi.org/10.1007/978-94-017-0524-0
Tags: Add Tag
No Tags, Be the first to tag this record!
id KOHA-OAI-TEST:213419
record_format koha
institution COLPOS
collection Koha
country México
countrycode MX
component Bibliográfico
access En linea
En linea
databasecode cat-colpos
tag biblioteca
region America del Norte
libraryname Departamento de documentación y biblioteca de COLPOS
language eng
topic Philosophy.
Logic.
Computers.
Mathematical logic.
Semantics.
Philosophy.
Logic.
Semantics.
Mathematical Logic and Foundations.
Theory of Computation.
Philosophy.
Logic.
Computers.
Mathematical logic.
Semantics.
Philosophy.
Logic.
Semantics.
Mathematical Logic and Foundations.
Theory of Computation.
spellingShingle Philosophy.
Logic.
Computers.
Mathematical logic.
Semantics.
Philosophy.
Logic.
Semantics.
Mathematical Logic and Foundations.
Theory of Computation.
Philosophy.
Logic.
Computers.
Mathematical logic.
Semantics.
Philosophy.
Logic.
Semantics.
Mathematical Logic and Foundations.
Theory of Computation.
Krynicki, Michał. editor.
Mostowski, Marcin. editor.
Szczerba, Lesław W. editor.
SpringerLink (Online service)
Quantifiers: Logics, Models and Computation [electronic resource] : Volume Two: Contributions /
description This volume contains a collection of research papers centered around the concept of quantifier. Recently this concept has become the central point of research in logic. It is one of the important logical concepts whose exact domain and applications have so far been insufficiently explored, especially in the area of inferential and semantic properties of languages. It should thus remain the central point of research in the future. Moreover, during the last twenty years generalized quantifiers and logical technics based on them have proved their utility in various applications. The example of natu­ rallanguage semantics has been partcularly striking. For a long time it has been belived that elementary logic also called first-order logic was an ade­ quate theory of logical forms of natural language sentences. Recently it has been accepted that semantics of many natural language constructions can­ not be properly represented in elementary logic. It has turned out, however, that they can be described by means of generalized quantifiers. As far as computational applications oflogic are concerned, particulary interesting are semantics restricted to finite models. Under this restriction elementary logic looses several of its advantages such as axiomatizability and compactness. And for various purposes we can use equally well some semantically richer languages of which generalized quantifiers offer the most universal methods of describing extensions of elementary logic. Moreover we can look at generalized quantifiers as an explication of some specific mathematical concepts, e. g.
format Texto
topic_facet Philosophy.
Logic.
Computers.
Mathematical logic.
Semantics.
Philosophy.
Logic.
Semantics.
Mathematical Logic and Foundations.
Theory of Computation.
author Krynicki, Michał. editor.
Mostowski, Marcin. editor.
Szczerba, Lesław W. editor.
SpringerLink (Online service)
author_facet Krynicki, Michał. editor.
Mostowski, Marcin. editor.
Szczerba, Lesław W. editor.
SpringerLink (Online service)
author_sort Krynicki, Michał. editor.
title Quantifiers: Logics, Models and Computation [electronic resource] : Volume Two: Contributions /
title_short Quantifiers: Logics, Models and Computation [electronic resource] : Volume Two: Contributions /
title_full Quantifiers: Logics, Models and Computation [electronic resource] : Volume Two: Contributions /
title_fullStr Quantifiers: Logics, Models and Computation [electronic resource] : Volume Two: Contributions /
title_full_unstemmed Quantifiers: Logics, Models and Computation [electronic resource] : Volume Two: Contributions /
title_sort quantifiers: logics, models and computation [electronic resource] : volume two: contributions /
publisher Dordrecht : Springer Netherlands : Imprint: Springer,
publishDate 1995
url http://dx.doi.org/10.1007/978-94-017-0524-0
work_keys_str_mv AT krynickimichałeditor quantifierslogicsmodelsandcomputationelectronicresourcevolumetwocontributions
AT mostowskimarcineditor quantifierslogicsmodelsandcomputationelectronicresourcevolumetwocontributions
AT szczerbalesławweditor quantifierslogicsmodelsandcomputationelectronicresourcevolumetwocontributions
AT springerlinkonlineservice quantifierslogicsmodelsandcomputationelectronicresourcevolumetwocontributions
_version_ 1756269202834980864
spelling KOHA-OAI-TEST:2134192018-07-30T23:47:02ZQuantifiers: Logics, Models and Computation [electronic resource] : Volume Two: Contributions / Krynicki, Michał. editor. Mostowski, Marcin. editor. Szczerba, Lesław W. editor. SpringerLink (Online service) textDordrecht : Springer Netherlands : Imprint: Springer,1995.engThis volume contains a collection of research papers centered around the concept of quantifier. Recently this concept has become the central point of research in logic. It is one of the important logical concepts whose exact domain and applications have so far been insufficiently explored, especially in the area of inferential and semantic properties of languages. It should thus remain the central point of research in the future. Moreover, during the last twenty years generalized quantifiers and logical technics based on them have proved their utility in various applications. The example of natu­ rallanguage semantics has been partcularly striking. For a long time it has been belived that elementary logic also called first-order logic was an ade­ quate theory of logical forms of natural language sentences. Recently it has been accepted that semantics of many natural language constructions can­ not be properly represented in elementary logic. It has turned out, however, that they can be described by means of generalized quantifiers. As far as computational applications oflogic are concerned, particulary interesting are semantics restricted to finite models. Under this restriction elementary logic looses several of its advantages such as axiomatizability and compactness. And for various purposes we can use equally well some semantically richer languages of which generalized quantifiers offer the most universal methods of describing extensions of elementary logic. Moreover we can look at generalized quantifiers as an explication of some specific mathematical concepts, e. g.to Volume II -- Quantifiers and Inference -- Operators on Branched Quantifiers -- Hilbert’s ?-Symbol in the Presence of Generalized Quantifiers -- Partially Ordered Connectives and Finite Graphs -- Theories of Finitely Determinate Linear Orderings in Stationary Logic -- Definable Second-Order Quantifiers and Quasivarieties -- Quantifiers Determined by Classes of Binary Relations -- Decidability Results for Classes of Ordered Abelian Groups in Logics with Ramsey-Quantifiers -- On the Eliminability of the Quantifier “There Exists Uncountably Many” -- Quantifiers Definable by Second Order Means -- Generalized Quantifiers in Algebra -- On Ordering of the Family of Logics with Skolem-Löwenheim Property and Countable Compactness Property -- Pre-Ordered Quantifiers in Elementary Sentences of Natural Language -- Some Remarks on Zawadowsky’s Theory of Preordered Quantifiers -- Index of Names -- Table of Contents to Volume I.This volume contains a collection of research papers centered around the concept of quantifier. Recently this concept has become the central point of research in logic. It is one of the important logical concepts whose exact domain and applications have so far been insufficiently explored, especially in the area of inferential and semantic properties of languages. It should thus remain the central point of research in the future. Moreover, during the last twenty years generalized quantifiers and logical technics based on them have proved their utility in various applications. The example of natu­ rallanguage semantics has been partcularly striking. For a long time it has been belived that elementary logic also called first-order logic was an ade­ quate theory of logical forms of natural language sentences. Recently it has been accepted that semantics of many natural language constructions can­ not be properly represented in elementary logic. It has turned out, however, that they can be described by means of generalized quantifiers. As far as computational applications oflogic are concerned, particulary interesting are semantics restricted to finite models. Under this restriction elementary logic looses several of its advantages such as axiomatizability and compactness. And for various purposes we can use equally well some semantically richer languages of which generalized quantifiers offer the most universal methods of describing extensions of elementary logic. Moreover we can look at generalized quantifiers as an explication of some specific mathematical concepts, e. g.Philosophy.Logic.Computers.Mathematical logic.Semantics.Philosophy.Logic.Semantics.Mathematical Logic and Foundations.Theory of Computation.Springer eBookshttp://dx.doi.org/10.1007/978-94-017-0524-0URN:ISBN:9789401705240