- New
-
Topics
- 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
- Journals
- Submit material
- More
More on trees and finite satisfiability: the taming of terms
Notre Dame Journal of Formal Logic 28 (3):392-394 (1987)
Abstract
This article has no associated abstract. (fix it)Links
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
My notes
Similar books and articles
Trees and finite satisfiability: proof of a conjecture of Burgess.George Boolos - 1984 - Notre Dame Journal of Formal Logic 25 (3):193-197.
Matrix satisfiability and axiomatization.Robert Ackermann - 1971 - Notre Dame Journal of Formal Logic 12 (3):309-321.
Satisfiability in a larger domain.R. L. Goodstein - 1974 - Notre Dame Journal of Formal Logic 15 (4):598-600.
Some examples of different methods of formal proofs with generalizations of the satisfiability definition.Juliusz Reichbach - 1969 - Notre Dame Journal of Formal Logic 10 (2):214-224.
BREAKUP: a preprocessing algorithm for satisfiability testing of CNF formulas.Robert Cowen & Katherine Wyatt - 1993 - Notre Dame Journal of Formal Logic 34 (4):602-606.
Some preservation results for classical and intuitionistic satisfiability in Kripke models.Zoran Marković - 1983 - Notre Dame Journal of Formal Logic 24 (3):395-398.
Duals of Smullyan trees.Hugues Leblanc & D. Paul Snyder - 1972 - Notre Dame Journal of Formal Logic 13 (3):387-393.
Locating vertices of trees.Martin M. Zuckerman - 1970 - Notre Dame Journal of Formal Logic 11 (3):375-378.
On $n$-equivalence of binary trees.Kees Doets - 1987 - Notre Dame Journal of Formal Logic 28 (2):238-243.
Analytics
Added to PP
2010-08-24
Downloads
22 (#700,635)
6 months
3 (#1,209,684)
2010-08-24
Downloads
22 (#700,635)
6 months
3 (#1,209,684)
Historical graph of downloads
Citations of this work
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-6686886f5-7g5mb uwo