- Submit
-
Browse
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- More
Switch to: Citations
References in:
Add references
You must login to add references.
|
|
|
Universal Algebra has become the most authoritative, consistently relied on text in a field with applications in other branches of algebra and other fields such as combinatorics, geometry, and computer science. Each chapter is followed by an extensive list of exercises and problems. The "state of the art" account also includes new appendices and a well selected additional bibliography of over 1250 papers and books which makes this an indispensable new edition for students, faculty, and workers in the field. |
|
|
The general aim of this book is to provide an elementary exposition of some basic concepts in terms of which both classical and non-dassicallogirs may be studied and appraised. Although quantificational logic is dealt with briefly in the last chapter, the discussion is chiefly concemed with propo gjtional cakuli. Still, the subject, as it stands today, cannot br covered in one book of reasonable length. Rather than to try to include in the volume as much as possible, I have put (...) |
|
|
|
|
|
I provide a truthmaker semantics for Angell’s system of analytic implication and establish completeness. |
|
|
A notation called sets-as-signs is developed, and then it is demonstrated how it can be used to modify any known inference method to handle many-valued logics. Applications are discussed, both in pure mathematics, and in hardware verification and interval arithmetic. Concludes with a historical overview of activities in many-valued theorem proving. Annotation copyright by Book News, Inc., Portland, OR. |
|
|
The concept of entailment is often connected with deducibility: A is said to entail B iff B is logically deducible from A.1 It has also been connected to the concept of containment in Kant’s sense of analytic containment: A entails B only if the meaning of B is contained in the meaning of A. But the concepts of deducibility and containment are two distinct concepts, and the failure to distinguish them leads to faulty attempts to merge them in formal systems. (...) |
|
|
In this article, we consider variations of Nuel Belnap’s ‘artificial reasoner’. In particular, we examine cases in which the artificial reasoner is faulty, e.g. situations in which the reasoner is unable to calculate the value of a formula due to an inability to retrieve the values of its atoms. In the first half of the article, we consider two ways of modelling such circumstances and prove the deductive systems arising from these two types of models to be equivalent to Graham (...) |
|
|
|
|
|
|
|
|
|
|
|
For a fixed similarity type which is at least binary, we show there is a linear time algorithm for computing the principal congruence generated by a pair of elements. |
|
|
A uniform construction for sequent calculi for finite-valued first-order logics with distribution quantifiers is exhibited. Completeness, cut-elimination and midsequent theorems are established. As an application, an analog of Herbrand’s theorem for the four-valued knowledge-representation logic of Belnap and Ginsberg is presented. It is indicated how this theorem can be used for reasoning about knowledge bases with incomplete and inconsistent information. |
|
|
Fast algorithms are presented which find the minimal nontrivial congruences, subalgebras, and ideals of a finite algebra, given by tables of its operations. Our method involves finding objects which are minimal among all nontrivial objects, i.e., objects distinct from the least one. The running times of the presented algorithms are O, in case of congruences, and O, in case of subalgebras and ideals, where n is the number of elements of the algebra and r is the maximal arity of its (...) |
|
|
|
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-64dd777598-b9rvg uwo