- 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
Best solving modal equations
Annals of Pure and Applied Logic 102 (3):183-198 (2000)
Abstract
We show that some common varieties of modal K4-algebras have finitary unification type, thus providing effective best solutions for equations in free algebras. Applications to admissible inference rules are immediateMy notes
Similar books and articles
Solving Pell Equations Locally in Models of I$Delta_0$.Paola D'Aquino - 1998 - Journal of Symbolic Logic 63 (2):402-410.
Circuit Synthesis by Solving Sequential Boolean Equations.Hao Wang - 1959 - Mathematical Logic Quarterly 5 (14‐24):291-322.
Hybrid Formulas and Elementarily Generated Modal Logics.Ian Hodkinson - 2006 - Notre Dame Journal of Formal Logic 47 (4):443-478.
Filtering unification and most general unifiers in modal logic.Silvio Ghilardi & Lorenzo Sacchetti - 2004 - Journal of Symbolic Logic 69 (3):879-906.
Review: Hao Wang, Circuit Synthesis by Solving Sequential Boolean Equations. [REVIEW]Calvin C. Elgot - 1960 - Journal of Symbolic Logic 25 (4):373-375.
Solving functional equations at higher types: some examples and some theorems.Richard Statman - 1986 - Notre Dame Journal of Formal Logic 27 (1):66-74.
The modal status of basic equations.Jussi Haukioja - 2001 - Philosophical Studies 104 (2):115 - 122.
Logical equations and admissible rules of inference with parameters in modal provability logics.V. V. Rybakov - 1990 - Studia Logica 49 (2):215 - 239.
Can the macroscopic Maxwell equations be obtained from the microscopic Maxwell-Lorentz equations by performing averages?C. C. Yan - 1995 - Foundations of Physics 25 (3):491-502.
Undefinability of propositional quantifiers in the modal system S.Silvio Ghilardi & Marek Zawadowski - 1995 - Studia Logica 55 (2):259 - 271.
A stochastic derivation of the Sivashinsky equation for the self-turbulent motion of a free particle.Kh Namsrai - 1980 - Foundations of Physics 10 (9-10):731-742.
Analytics
Added to PP
2014-01-16
Downloads
10 (#1,123,760)
6 months
3 (#880,460)
2014-01-16
Downloads
10 (#1,123,760)
6 months
3 (#880,460)
Historical graph of downloads
Citations of this work
Proof theory for admissible rules.Rosalie Iemhoff & George Metcalfe - 2009 - Annals of Pure and Applied Logic 159 (1-2):171-186.
Admissible rules in the implication–negation fragment of intuitionistic logic.Petr Cintula & George Metcalfe - 2010 - Annals of Pure and Applied Logic 162 (2):162-171.
Structural Completeness in Substructural Logics.J. S. Olson, J. G. Raftery & C. J. Van Alten - 2008 - Logic Journal of the IGPL 16 (5):453-495.
References found in this work
Unification in intuitionistic logic.Silvio Ghilardi - 1999 - Journal of Symbolic Logic 64 (2):859-880.
Problems of substitution and admissibility in the modal system Grz and in intuitionistic propositional calculus.V. V. Rybakov - 1990 - Annals of Pure and Applied Logic 50 (1):71-106.
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-6d9b7f7c4c-v4fj8 uwo