Browse Results

Showing 29,076 through 29,100 of 54,429 results

Logica: Volume 1 - Dimostrazioni E Modelli Al Primo Ordine (UNITEXT #80)

by Vito Michele Abrusci Lorenzo Tortora de Falco

L'opera si propone come testo di riferimento per acquisire una solida preparazione specialistica nella Logica, presentando in maniera rigorosa ed innovativa argomenti tradizionalmente affrontati nei corsi universitari di secondo livello. Questo secondo volume, che completa l'opera, presenta le basi della teoria della ricorsività, l'aritmetica di Peano ed i teoremi di incompletezza, gli assiomi della teoria assiomatica degli insiemi di Zermelo-Fraenkel e la teoria degli ordinali e dei cardinali che ne deriva.

Logica: Volume 1 - Dimostrazioni e modelli al primo ordine (UNITEXT #80)

by Vito Michele Abrusci Lorenzo Tortora de Falco

Gli autori, basandosi sulla loro esperienza di ricerca, propongono in due volumi un testo di riferimento per acquisire una solida formazione specialistica nella logica.Nei due volumi vengono presentati in maniera innovativa e rigorosa temi di logica tradizionalmente affrontati nei corsi universitari di secondo livello.Questo primo volume è dedicato ai teoremi fondamentali sulla logica del primo ordine e alle loro principali conseguenze.Il testo è rivolto in particolare agli studenti dei corsi di laurea magistrale.

Logica: Metodo Breve (UNITEXT #50)

by Daniele Mundici

Senza richiedere prerequisiti il testo si propone di fornire una dimostrazione dei fondamentali teoremi della logica matematica (compattezza, completezza di Gödel, Löwenheim-Skolem) introducendo i concetti sintattici e semantici in modo progressivo, dalla logica booleana a quella predicativa. Per facilitare la lettura attiva, il testo contiene numerosi esercizi.

Logica Universalis: Towards a General Theory of Logic

by Jean-Yves Beziau

Universal Logic is not a new logic, but a general theory of logics, considered as mathematical structures. The name was introduced about ten years ago, but the subject is as old as the beginning of modern logic. It was revived after the flowering of thousands of new logics during the last thirty years: there was a need for a systematic theory of logics to put some order in this chaotic multiplicity. The present book contains recent works on universal logic by first-class researchers from all around the world. The book is full of new and challenging ideas that will guide the future of this exciting subject. It will be of interest for people who want to better understand what logic is. It will help those who are lost in the jungle of heterogeneous logical systems to find a way. Tools and concepts are provided here for those who want to study classes of already existing logics or want to design and build new ones.

Logica Universalis: Towards a General Theory of Logic

by Jean-Yves Beziau

Universal Logic is not a new logic, but a general theory of logics, considered as mathematical structures. The name was introduced about ten years ago, but the subject is as old as the beginning of modern logic. It was revived after the flowering of thousands of new logics during the last thirty years: there was a need for a systematic theory of logics to put some order in this chaotic multiplicity. The present book contains recent works on universal logic by first-class researchers from all around the world. The book is full of new and challenging ideas that will guide the future of this exciting subject. It will be of interest for people who want to better understand what logic is. It will help those who are lost in the jungle of heterogeneous logical systems to find a way. Tools and concepts are provided here for those who want to study classes of already existing logics or want to design and build new ones.

Logical Analysis of Hybrid Systems: Proving Theorems for Complex Dynamics

by André Platzer

Hybrid systems are models for complex physical systems and have become a widely used concept for understanding their behavior. Many applications are safety-critical, including car, railway, and air traffic control, robotics, physical–chemical process control, and biomedical devices. Hybrid systems analysis studies how we can build computerized controllers for physical systems which are guaranteed to meet their design goals. The author gives a unique, logic-based perspective on hybrid systems analysis. It is the first book that leverages the power of logic for hybrid systems. The author develops a coherent logical approach for systematic hybrid systems analysis, covering its theory, practice, and applications. It is further shown how the developed verification techniques can be used to study air traffic and railway control systems. This book is intended for researchers, postgraduates, and professionals who are interested in hybrid systems analysis, cyberphysical or embedded systems design, logic and theorem proving, or transportation and automation.

Logical and Computational Aspects of Model-Based Reasoning (Applied Logic Series #25)

by L. Magnani N. J. Nersessian Claudio Pizzi

Information technology has been, in recent years, under increasing commercial pressure to provide devices and systems which help/ replace the human in his daily activity. This pressure requires the use of logic as the underlying foundational workhorse of the area. New logics were developed as the need arose and new foci and balance has evolved within logic itself. One aspect of these new trends in logic is the rising impor­ tance of model based reasoning. Logics have become more and more tailored to applications and their reasoning has become more and more application dependent. In fact, some years ago, I myself coined the phrase "direct deductive reasoning in application areas", advocating the methodology of model-based reasoning in the strongest possible terms. Certainly my discipline of Labelled Deductive Systems allows to bring "pieces" of the application areas as "labels" into the logic. I therefore heartily welcome this important book to Volume 25 of the Applied Logic Series and see it as an important contribution in our overall coverage of applied logic.

A Logical Approach to Philosophy: Essays in Honour of Graham Solomon (The Western Ontario Series in Philosophy of Science #69)

by David DeVidi Tim Kenyon

Graham Solomon, to whom this collection is dedicated, went into hospital for antibiotic treatment of pneumonia in Oc- ber, 2001. Three days later, on Nov. 1, he died of a massive stroke, at the age of 44. Solomon was well liked by those who got the chance to know him—it was a revelation to ?nd out, when helping to sort out his a?airs after his death, how many “friends” he had whom he had actually never met, as his email included correspondence with philosophers around the world running sometimes to hundreds of messages. He was well respected in the philosophical community more broadly. He was for several years a member of the editorial board for the Western Ontario Series in Philosophy of Science. While he was employed at Wilfrid Laurier University in Waterloo, Ontario, several of us at the University of Wat- loo always regarded our own department as a sort of second academic home for him. We therefore decided that it would be appropriate to hold a memorial conference in his honour. Thanks to the generous ?nancial support of the Humphrey Conference Fund, we were able to do so in May 2003. Many of the papers in this volume were presented at that conf- ence.

Logical Aspects of Computational Linguistics: 8th International Conference, LACL 2014, Toulouse, France, June 18-24, 2014. Proceedings (Lecture Notes in Computer Science #8535)

by Nicholas Asher Sergei Soloviev

Edited in collaboration with FoLLI, the Association of Logic, Language and Information, this book constitutes the refereed proceedings of the 8th International Conference on Logical Aspects of Computational Linguistics (LACL 2014) held in Toulouse, France, in June 2014. On the broadly syntactic side, there are papers on the logical and computational foundations of context free grammars, pregroup grammars, on the Lambek calculus and on formalizations of aspects of minimalism. There is also a paper on Abstract Categorical Grammar, as well as papers on issues at the syntax/semantics interface. On the semantic side, the volume's papers address monotonicity reasoning and the semantics of adverbs in type theory, proof theoretical semantics and predicate and argument invariance.

Logical Aspects of Computational Linguistics: 7th International Conference, LACL 2012, Nantes, France, July 2-4, 2012, Proceedings (Lecture Notes in Computer Science #7351)

by Denis Bechet Alexandre Dikovsky

Edited in collaboration with FoLLI, the Association of Logic, Language and Information, this book constitutes the refereed proceedings of the 7th International Conference on Logical Aspects of Computational Linguistics, LACL 2012, held in Nantes, France, in July 2012. The 15 revised full papers presented together with 2 invited talks were carefully reviewed and selected from 24 submissions. The papers are organized in topical sections on logical foundation of syntactic formalisms, logics for semantics of lexical items, sentences, discourse and dialog, applications of these models to natural language processing, type theoretic, proof theoretic, model theoretic and other logically based formal methods for describing natural language syntax, semantics and pragmatics, as well as the implementation of natural language processing software relying on such methods.

Logical Aspects of Computational Linguistics: 5th International Conference, LACL 2005, Bordeaux, France, April 28-30, 2005, Proceedings (Lecture Notes in Computer Science #3492)

by Philippe Blache Edward Stabler Joan Busquets Richard Moot

Edited in collaboration with FoLLI, the Association of Logic, Language and Information, this book inaugurates the new FoLLI LNAI subline. It constitutes the refereed proceedings of the 5th International Conference on Logical Aspects of Computational Linguistics, LACL 2005, held in Bordeaux, France in April 2005. The 25 revised full papers presented were carefully reviewed and selected from over 40 submissions. The papers address a wide range of logical and formal methods in computational linguistics with studies of particular grammar formalisms and their computational properties, language engineering, and traditional topics about the syntax/semantics interface.

Logical Aspects of Computational Linguistics: Third International Conference, LACL'98 Grenoble, France, December 14-16, 1998 Selected Papers (Lecture Notes in Computer Science #2014)

by Michael Moortgat

The conference series Logical Aspects of Computational Linguistics (LACL) aims at providing a forum for the presentation and discussion of current research in all the formal and logical aspects of computational linguistics. The LACL initiative started with a workshop held in Nancy (France) in 1995. Selected papers from this event have appeared as a special issue of the Journal of Logic Language and Information, Volume 7(4), 1998. In 1996, LACL shifted to the format of an international conference. LACL’96 and ’97 were both held in Nancy (France). The proceedings appeared as volumes 1328 and 1582 of the Springer Lecture Notes in Arti cial Intelligence. This volume contains selected papers of the third international conference on Logical Aspects of Computational Linguistics (LACL’98), held in Grenoble, France, from December 14 to 16, 1998. The conference was organized by the U- versity Pierre Mend es-France (Grenoble 2) together with LORIA (Laboratoire Lorrain d’Informatique et Applications, Nancy). On the basis of 33 submitted 4-page abstracts, the Program Committee selected 19 contributions for pres- tation. In addition to the selected papers, the program featured three invited talks, by Maarten de Rijke (ILLC, Amsterdam), Makoto Kanazawa (Chiba U- versity, Japan), and Fernando Pereira (AT&T Labs). After the conference, the contributors were invited to submit a full paper for the conference proceedings.

Logical Aspects of Computational Linguistics: Second International Conference, LACL'97, Nancy, France, September 22-24, 1997, Selected Papers (Lecture Notes in Computer Science #1582)

by Guy Perrier Alain Lecomte Francois Lamarche

This book constitutes the thoroughly refereed post-proceedings of the Second International Conference on Logical Aspects of Computational Linguistics, LACL '97, held in Nancy, France in September 1997.The 10 revised full papers presented were carefully selected during two rounds of reviewing. Also included are two comprehensive invited papers. Among the topics covered are type theory, various types of grammars, linear logic, parsing, type-directed natural language processing, proof-theoretic aspects, concatenation logics, and mathematical languages.

Logical Aspects of Computational Linguistics: 6th International Conference, LACL 2011, Montpellier, France, June 29 -- July 1, 2011. Proceedings (Lecture Notes in Computer Science #6736)

by Sylvain Pogodalla Jean-Philippe Prost

This book constitutes the refereed proceedings of the 6th International Conference on Logical Aspects of Computational Linguistics, LACL 2011, held in Montpellier, France, in June/July 2011. The 18 revised full papers presented were carefully reviewed and selected from 31 submissions. The papers address a wide range of logical and formal methods in computational linguistics such as type-theoretic grammars, dependency grammars, formal language theory, grammatical inference, minimalism, generation, and lexical and formal semantics.

Logical Form: Between Logic and Natural Language (Synthese Library #393)

by Andrea Iacona

Logical form has always been a prime concern for philosophers belonging to the analytic tradition. For at least one century, the study of logical form has been widely adopted as a method of investigation, relying on its capacity to reveal the structure of thoughts or the constitution of facts. This book focuses on the very idea of logical form, which is directly relevant to any principled reflection on that method. Its central thesis is that there is no such thing as a correct answer to the question of what is logical form: two significantly different notions of logical form are needed to fulfill two major theoretical roles that pertain respectively to logic and to semantics. This thesis has a negative and a positive side. The negative side is that a deeply rooted presumption about logical form turns out to be overly optimistic: there is no unique notion of logical form that can play both roles. The positive side is that the distinction between two notions of logical form, once properly spelled out, sheds light on some fundamental issues concerning the relation between logic and language.

Logical Foundations for Cognitive Agents: Contributions in Honor of Ray Reiter (Artificial Intelligence)

by Hector J. Levesque Fiora Pirri

It is a pleasure and an honor to be able to present this collection of papers to Ray Reiter on the occasion of his 60th birthday. To say that Ray's research has had a deep impact on the field of Artificial Intel­ ligence is a considerable understatement. Better to say that anyone thinking of do­ ing work in areas like deductive databases, default reasoning, diagnosis, reasoning about action, and others should realize that they are likely to end up proving corol­ laries to Ray's theorems. Sometimes studying related work makes us think harder about the way we approach a problem; studying Ray's work is as likely to make us want to drop our way of doing things and take up his. This is because more than a mere visionary, Ray has always been a true leader. He shows us how to proceed not by pointing from his armchair, but by blazing a trail himself, setting up camp, and waiting for the rest of us to arrive. The International Joint Conference on Ar­ tificial Intelligence clearly recognized this and awarded Ray its highest honor, the Research Excellence award in 1993, before it had even finished acknowledging all the founders of the field. The papers collected here sample from many of the areas where Ray has done pi­ oneering work. One of his earliest areas of application was databases, and this is re­ flected in the chapters by Bertossi et at. and the survey chapter by Minker.

Logical Foundations of Computer Science: International Symposium, LFCS 2018, Deerfield Beach, FL, USA, January 8–11, 2018, Proceedings (Lecture Notes in Computer Science #10703)

by Sergei Artemov Anil Nerode

This book constitutes the refereed proceedings of the International Symposium on Logical Foundations of Computer Science, LFCS 2018, held in Deerfield Beach, FL, USA, in January 2018.The 22 revised full papers were carefully reviewed and selected from 22 submissions. The scope of the Symposium is broad and includes constructive mathematics and type theory; homotopy type theory; logic, automata, and automatic structures; computability and randomness; logical foundations of programming; logical aspects of computational complexity; parameterized complexity; logic programming and constraints; automated deduction and interactive theorem proving; logical methods in protocol and program verification; logical methods in program specification and extraction; domain theory logics; logical foundations of database theory; equational logic and term rewriting; lambda andcombinatory calculi; categorical logic and topological semantics; linear logic; epistemic and temporal logics; intelligent and multiple-agent system logics; logics of proof and justification; non-monotonic reasoning; logic in game theory and social software; logic of hybrid systems; distributed system logics; mathematical fuzzy logic; system design logics; and other logics in computer science.

Logical Foundations of Computer Science: International Symposium, LFCS 2016, Deerfield Beach, FL, USA, January 4-7, 2016. Proceedings (Lecture Notes in Computer Science #9537)

by Sergei Artemov Anil Nerode

This book constitutes the refereed proceedings of the International Symposium on Logical Foundations of Computer Science, LFCS 2016, held in Deerfield Beach, FL, USA in January 2016. The 27 revised full papers were carefully reviewed and selected from 46 submissions. The scope of the Symposium is broad and includes constructive mathematics and type theory; homotopy type theory; logic, automata, and automatic structures; computability and randomness; logical foundations of programming; logical aspects of computational complexity; parameterized complexity; logic programming and constraints; automated deduction and interactive theorem proving; logical methods in protocol and program verification; logical methods in program specification and extraction; domain theory logics; logical foundations of database theory; equational logic and term rewriting; lambda and combinatory calculi; categorical logic and topological semantics; linear logic; epistemic and temporal logics; intelligent and multiple-agent system logics; logics of proof and justification; non-monotonic reasoning; logic in game theory and social software; logic of hybrid systems; distributed system logics; mathematical fuzzy logic; system design logics; and other logics in computer science.

Logical Foundations of Computer Science: International Symposium, LFCS 2020, Deerfield Beach, FL, USA, January 4–7, 2020, Proceedings (Lecture Notes in Computer Science #11972)

by Sergei Artemov Anil Nerode

This book constitutes the refereed proceedings of the International Symposium on Logical Foundations of Computer Science, LFCS 2020, held in Deerfield Beach, FL, USA, in January 2020. The 17 revised full papers were carefully reviewed and selected from 30 submissions. The scope of the Symposium is broad and includes constructive mathematics and type theory; homotopy type theory; logic, automata, and automatic structures; computability and randomness; logical foundations of programming; logical aspects of computational complexity; parameterized complexity; logic programming and constraints; automated deduction and interactive theorem proving; logical methods in protocol and program verification; logical methods in program specification and extraction; domain theory logics; logical foundations of database theory; equational logic and term rewriting; lambda and combinatory calculi; categorical logic and topological semantics; linear logic; epistemic and temporal logics; intelligent and multiple-agent system logics; logics of proof and justification; non-monotonic reasoning; logic in game theory and social software; logic of hybrid systems; distributed system logics; mathematical fuzzy logic; system design logics; other logics in computer science.

Logical Foundations of Computer Science: International Symposium, LFCS 2022, Deerfield Beach, FL, USA, January 10–13, 2022, Proceedings (Lecture Notes in Computer Science #13137)

by Sergei Artemov Anil Nerode

This book constitutes the refereed proceedings of the International Symposium on Logical Foundations of Computer Science, LFCS 2022, held in Deerfield Beach, FL, USA, in January 2022. The 23 revised full papers were carefully reviewed and selected from 35 submissions. The scope of the Symposium is broad and includes constructive mathematics and type theory; homotopy type theory; logic, automata, and automatic structures; computability and randomness; logical foundations of programming; logical aspects of computational complexity; parameterized complexity; logic programming and constraints; automated deduction and interactive theorem proving; logical methods in protocol and program verification; logical methods in program specification and extraction; domain theory logics; logical foundations of database theory; equational logic and term rewriting; lambda and combinatory calculi; categorical logic and topological semantics; linear logic; epistemic and temporal logics; intelligent and multiple-agent system logics; logics of proof and justification; non-monotonic reasoning; logic in game theory and social software; logic of hybrid systems; distributed system logics; mathematical fuzzy logic; system design logics; other logics in computer science.

Logical Foundations of Computer Science: International Symposium, LFCS 2009, Deerfield Beach, FL, USA, January 3-6, 2009, Proceedings (Lecture Notes in Computer Science #5407)

by Sergei Artemov Anil Nerode

This book constitutes the refereed proceedings of the International Symposium on Logical Foundations of Computer Science, LFCS 2009, held in Deerfield Beach, Florida, USA in January 2008. The volume presents 31 revised refereed papers carefully selected by the program committee. All current aspects of logic in computer science are addressed, including constructive mathematics and type theory, logical foundations of programming, logical aspects of computational complexity, logic programming and constraints, automated deduction and interactive theorem proving, logical methods in protocol and program verification and in program specification and extraction, domain theory logics, logical foundations of database theory, equational logic and term rewriting, lambda and combinatory calculi, categorical logic and topological semantics, linear logic, epistemic and temporal logics, intelligent and multiple agent system logics, logics of proof and justification, nonmonotonic reasoning, logic in game theory and social software, logic of hybrid systems, distributed system logics, system design logics, as well as other logics in computer science.

Logical Foundations of Computer Science: International Symposium, LFCS 2007, New York, NY, USA, June 4-7, 2007, Proceedings (Lecture Notes in Computer Science #4514)

by Sergei Artemov Anil Nerode

This book constitutes the refereed proceedings of the International Symposium on Logical Foundations of Computer Science, LFCS 2007, held in New York, NY, USA in June 2007. The volume presents 36 revised refereed papers that address all current aspects of logic in computer science.

Logical Foundations of Computer Science: International Symposium, LFCS 2013, San Diego, CA, USA, January 6-8, 2013. Proceedings (Lecture Notes in Computer Science #7734)

by Sergei Artemov Anil Nerode

This book constitutes the refereed proceedings of the International Symposium on Logical Foundations of Computer Science, LFCS 2013, held in San Diego, CA, USA in January 2013. The volume presents 29 revised refereed papers carefully selected by the program committee. The scope of the Symposium is broad and includes constructive mathematics and type theory; logic, automata and automatic structures; computability and randomness; logical foundations of programming; logical aspects of computational complexity; logic programming and constraints; automated deduction and interactive theorem proving; logical methods in protocol and program verification; logical methods in program specification and extraction; domain theory logic; logical foundations of database theory; equational logic and term rewriting; lambda and combinatory calculi; categorical logic and topological semantics; linear logic; epistemic and temporal logics; intelligent and multiple agent system logics; logics of proof and justification; nonmonotonic reasoning; logic in game theory and social software; logic of hybrid systems; distributed system logics; mathematical fuzzy logic; system design logics; and other logics in computer science.

Refine Search

Showing 29,076 through 29,100 of 54,429 results