Search

Este libro abarca todos los temas que son objeto de estudio en el programa de lógica matemática para estudiantes de diversas carreras, especialmente estudiantes de ingeniería, que ofrece el Departamento de Matemáticas de la Universidad Central. Así, en sus nueve capítulos, se aborda la teoría de conjuntos, el razonamiento lógico, la sintaxis de fórmulas, la semántica de proposiciones, la inferencia lógica, la lógica de primer orden, los silogismos categóricos, los métodos de demostración y las álgebras de Boole. En cada capítulo se ofrece al estudiante una explicación con ejemplos, seguida de una serie de problemas prácticos para ser resueltos de forma individual o en grupo, con el fin de favorecer el aprendizaje integral de todos los contenidos.

Un calcul logique, au sens large, est une méthode de résolution appliquée au traitement d'une structure propositionnelle. Les propositions constituant cette structure peuvent aussi bien être des expressions d'une langue naturelle (comme le français) que des expressions d'un langage formalisé (comme l'arithmétique), liées entre elles par une dépendance de nature fonctionnelle. Cet ouvrage constitue une introduction à deux outils de calcul en logique du premier ordre, soit le calcul en arbres de consistance et le calcul en déduction naturelle. La première partie, centrée sur la notion de structure propositionnelle, expose les concepts, les objets et les méthodes propres à la logique propositionnelle. Dans la deuxième partie, la logique propositionnelle est étendue à la logique prédicative au moyen de la quantification et de concepts caractéristiques d'un langage du premier ordre. Les deux outils de calcul sont ensuite enrichis de manière à pouvoir traiter des fonctions propositionnelles, soit des prédicats du premier ordre. De nombreux exemples et exercices, accompagnés de leurs solutions, aideront l'étudiant à progresser vers des calculs toujours plus complexes et à raffiner ses méthodes de calcul logique.

This book is an up-to-date introduction to simple theories and hyperimaginaries, with special attention to Lascar strong types and elimination of hyperimaginary problems. Assuming only knowledge of general model theory, the foundations of forking, stability and simplicity are presented in full detail. The treatment of the topics is as general as possible, working with stable formulas and types and assuming stability or simplicity of the theory only when necessary. The author offers an introduction to independence relations as well as a full account of canonical bases of types in stable and simple theories. In the last chapters the notions of internality and analyzability are discussed and used to provide a self-contained proof of elimination of hyperimaginaries in supersimple theories.

Bringing together over twenty years of research, this book gives a complete overview of independence-friendly logic. It emphasizes the game-theoretical approach to logic, according to which logical concepts such as truth and falsity are best understood via the notion of semantic games. The book pushes the paradigm of game-theoretical semantics further than the current literature by showing how mixed strategies and equilibria can be used to analyze independence-friendly formulas on finite models. The book is suitable for graduate students and advanced undergraduates who have taken a course on first-order logic. It contains a primer of the necessary background in game theory, numerous examples and full proofs.

Dependence is a common phenomenon, wherever one looks: ecological systems, astronomy, human history, stock markets - but what is the logic of dependence? This book is the first to carry out a systematic logical study of this important concept, giving on the way a precise mathematical treatment of Hintikka's independence friendly logic. Dependence logic adds the concept of dependence to first order logic. Here the syntax and semantics of dependence logic are studied, dependence logic is given an alternative game theoretic semantics, and results about its complexity are proven. This is a graduate textbook suitable for a special course in logic in mathematics, philosophy and computer science departments, and contains over 200 exercises, many of which have a full solution at the end of the book. It is also accessible to readers, with a basic knowledge of logic, interested in new phenomena in logic.

Henkin-Keisler models emanate from a modification of the Henkin construction introduced by Keisler to motivate the definition of ultraproducts. Keisler modified the Henkin construction at that point at which `new'individual constants are introduced and did so in a way that illuminates a connection between Henkin-Keisler models and ultraproducts. The resulting construction can be viewed both as a specialization of the Henkin construction and as an alternative to the ultraproduct construction. These aspects of the Henkin-Keisler construction are utilized here to present a perspective on ultraproducts and their applications accessible to the reader familiar with Henkin's proof of the completeness of first order logic and naive set theory. This approach culminates in proofs of various forms of the Keisler-Shelah characterizations of elementary equivalence and elementary classes via Henkin-Keisler models. The presentation is self-contained and proofs of more advanced results from set theory are introduced as needed. Audience: Logicians in philosophy, computer science, linguistics and mathematics.