Studia Logica
Công bố khoa học tiêu biểu
* Dữ liệu chỉ mang tính chất tham khảo
Sắp xếp:
Algebraic logic for classical conjunction and disjunction
Studia Logica - Tập 52 - Trang 181-181 - 1993
Coherence and Computational Complexity of Quantifier-free Dependence Logic Formulas
Studia Logica - Tập 101 - Trang 267-291 - 2013
We study the computational complexity of the model checking problem for quantifier-free dependence logic
$${(\mathcal{D})}$$
formulas. We characterize three thresholds in the complexity: logarithmic space (LOGSPACE), non-deterministic logarithmic space (NL) and non-deterministic polynomial time (NP).
Анализ и оБоБщение метода лроверки логических формул диаграммами веннч
Studia Logica - Tập 1 - Trang 214-244 - 1953
Tŀumaczenie w sensie psychologicznym i metodologicznym
Studia Logica - Tập 9 Số 1 - Trang 245-256 - 1960
An extension of the Łukasiewicz logic to the modal logic of quantum mechanics
Studia Logica - Tập 37 - Trang 149-155 - 1978
An attempt is made to include the axioms of Mackey for probabilities of experiments in quantum mechanics into the calculusŁ
x0
of Łukasiewicz. The obtained calculusŁQ contains an additional modal signQ and four modal rules of inference. The propositionQx is read “x is confirmed”. The most specific rule of inference may be read: for comparable observations implic......
Postponement of $$\mathsf {raa}$$ and Glivenko’s Theorem, Revisited
Studia Logica - Tập 107 Số 1 - Trang 109-144 - 2019
We study how to postpone the application of the reductio ad absurdum rule ( $$\mathsf {raa}$$ ) in classical natural deduction. This technique is connected with two normalization strategies for classical logic, due to Prawitz and Seldin, respectively. We introduce a variant of Seldin’s strategy for the postponement of $$\mathsf {raa}$$ , which induces a negative translation (a variant of Kuroda’s ......
Ewa Orlowska and Joanna Golinska-Pilarek, Dual Tableaux: Foundations, Methodology, Case Studies, Springer, Series: Trends in Logic, Vol. 33, 2011, pp. xvi+523, 113 illus. ISBN: 978-94-007-0004-8 (hardcover) EURO 181,85, 978-94-007-0005-5 (eBook) EURO 159,99.
Studia Logica - Tập 101 - Trang 229-232 - 2013
Propositional Plausible Logic: Introduction and Implementation
Studia Logica - Tập 67 - Trang 243-269 - 2001
Plausible Logic allows defeasible deduction with arbitrary propositions, and yet when sufficiently simplified it is very similar to the Defeasible Logics of Billington and Nute. This paper presents Plausible Logic, explains some of the ideas behind the definitions, applies Plausible Logic to an example, and proves a coherence result which indicates that Plausible Logic is well behaved. We also rep......
Tổng số: 2,253
- 1
- 2
- 3
- 4
- 5
- 6
- 10