45 research outputs found
Maths, Logic and Language
A work on the philosophy of mathematics (2017)
‘Number’, such a simple idea, and yet it fascinated and absorbed the
greatest proportion of human geniuses over centuries, not to mention the
likes of Pythagoras, Euclid, Newton, Leibniz, Descartes and countless
maths giants like Euler, Gauss and Hilbert, etc.. Einstein thought of pure
maths as the poetry of logical ideas, the exactitude of which, although
independent of experience, strangely seems to benefit the study of the
objects of reality. And, interestingly as well as surprisingly we are
nowhere near any clear understandings of numbers despite discoveries
of many productive usages of numbers. This is - rightly or wrongly - a
humble attempt to approach the subject from an angle hitherto
unthought-of
Topics in Programming Languages, a Philosophical Analysis through the case of Prolog
[EN]Programming languages seldom find proper anchorage in philosophy of logic, language and science. is more, philosophy of language seems to be restricted to natural languages and linguistics, and even philosophy of logic is rarely framed into programming languages topics. The logic programming paradigm and Prolog are, thus, the most adequate paradigm and programming language to work on this subject, combining natural language processing and linguistics, logic programming and constriction methodology on both algorithms and procedures, on an overall philosophizing declarative status. Not only this, but the dimension of the Fifth Generation Computer system related to strong Al wherein Prolog took a major role. and its historical frame in the very crucial dialectic between procedural and declarative paradigms, structuralist and empiricist biases, serves, in exemplar form, to treat straight ahead philosophy of logic, language and science in the contemporaneous age as well.
In recounting Prolog's philosophical, mechanical and algorithmic harbingers, the opportunity is open to various routes. We herein shall exemplify some:
- the mechanical-computational background explored by Pascal, Leibniz, Boole, Jacquard, Babbage, Konrad Zuse, until reaching to the ACE (Alan Turing) and EDVAC (von Neumann), offering the backbone in computer architecture, and the work of Turing, Church, Gödel, Kleene, von Neumann, Shannon, and others on computability, in parallel lines, throughly studied in detail, permit us to interpret ahead the evolving realm of programming languages. The proper line from lambda-calculus, to the Algol-family, the declarative and procedural split with the C language and Prolog, and the ensuing branching and programming languages explosion and further delimitation, are thereupon inspected as to relate them with the proper syntax, semantics and philosophical élan of logic programming and Prolog
Recommended from our members
Symbolic Logic
Ver. 10.04. Textbook for symbolic logic, beginning at a level appropriate for beginning students, continuing through Godel\u27s completeness and incompleteness theorems. The text naturally divides into two volumes, the first for reasoning in logic, the second for reasoning about it.
From the preface: There is, I think, a gap between what many students learn in their first course in formal logic, and what they are expected to know for their second. While courses in mathematical logic with metalogical components often cast only the barest glance at mathematical induction or even the very idea of reasoning from definitions, a first course may also leave these untreated, and fail explicitly to lay down the definitions upon which the second course is based. The aim of this text is to integrate material from these courses and, in particular, to make serious mathematical logic accessible to students I teach. The first parts introduce classical symbolic logic as appropriate for beginning students; the last parts build to Gödel’s adequacy and incompleteness results. A distinctive feature of the last section is a complete development of Gödel’s second incompleteness theorem.
Contents
Front Matter
I The Elements: Four Notions of Validity
1 Logical Validity and Soundness
2 Formal Languages
3 Axiomatic Deduction
4 Semantics
5 Translation
6 Natural Deduction
II Transition: Reasoning About Logic
7 Direct Semantic Reasoning
8 Mathematical Induction
III Classical Metalogic: Soundness and Completeness
9 Preliminary Results
10 Main Results
11 More Main Results
IV Logic and Arithmetic: Incompleteness and Computability
12 Recursive Functions and Q
13 Gödel’s Theorems
14 Logic and Computability
Concluding Remarks
Bibliography
Indexhttps://scholarworks.lib.csusb.edu/books/1000/thumbnail.jp
Proof-theoretic Semantics for Intuitionistic Multiplicative Linear Logic
This work is the first exploration of proof-theoretic semantics for a substructural logic. It focuses on the base-extension semantics (B-eS) for intuitionistic multiplicative linear logic (IMLL). The starting point is a review of Sandqvist’s B-eS for intuitionistic propositional logic (IPL), for which we propose an alternative treatment of conjunction that takes the form of the generalized elimination rule for the connective. The resulting semantics is shown to be sound and complete. This motivates our main contribution, a B-eS for IMLL
, in which the definitions of the logical constants all take the form of their elimination rule and for which soundness and completeness are established
19th Brazilian Logic Conference: Book of Abstracts
This is the book of abstracts of the 19th Brazilian Logic Conferences. The Brazilian Logic Conferences (EBL) is one of the most traditional logic conferences in South America. Organized by the Brazilian Logic Society (SBL), its main goal is to promote the dissemination of research in logic in a broad sense. It has been occurring since 1979, congregating logicians of different fields — mostly philosophy, mathematics and computer science — and with different backgrounds — from undergraduate students to senior researchers. The meeting is an important moment for the Brazilian and South American logical community to join together and discuss recent developments of the field. The areas of logic covered in the conference spread over foundations and philosophy of science, analytic philosophy, philosophy and history of logic, mathematics, computer science, informatics, linguistics and artificial intelligence. Previous editions of the EBL have been a great success, attracting researchers from all over Latin America and elsewhere.
The 19th edition of EBL takes place from May 6-10, 2019, in the beautiful city of João Pessoa, at the northeast coast of Brazil. It is conjointly organized by Federal University of ParaÃba (UFPB), whose main campus is located in João Pessoa, Federal University of Campina Grande (UFCG), whose main campus is located in the nearby city of Campina Grande (the second-largest city in ParaÃba state) and SBL. It is sponsored by UFPB, UFCG, the Brazilian Council for Scientific and Technological Development (CNPq) and the State Ministry of Education, Science and Technology of ParaÃba. It takes place at Hotel Luxxor Nord Tambaú, privileged located right in front Tambaú beach, one of João Pessoa’s most famous beaches
Automated Reasoning
This volume, LNAI 13385, constitutes the refereed proceedings of the 11th International Joint Conference on Automated Reasoning, IJCAR 2022, held in Haifa, Israel, in August 2022. The 32 full research papers and 9 short papers presented together with two invited talks were carefully reviewed and selected from 85 submissions. The papers focus on the following topics: Satisfiability, SMT Solving,Arithmetic; Calculi and Orderings; Knowledge Representation and Jutsification; Choices, Invariance, Substitutions and Formalization; Modal Logics; Proofs System and Proofs Search; Evolution, Termination and Decision Prolems. This is an open access book