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:  
Basic Conditional Reasoning: How Children Mimic Counterfactual Reasoning
Studia Logica - - 2014
Brian Leahy, Eva Rafetseder, Josef Perner
Sur l'axiome de Zermelo et son rôle dans les mathématiques contemporaines
Studia Logica - Tập 24 - Trang 178-178 - 1969
L. Chwistek
Imperatives: a Judgemental Analysis
Studia Logica - Tập 100 - Trang 879-905 - 2012
Chris Fox
This paper proposes a framework for formalising intuitions about the behaviour of imperative commands. It seeks to capture notions of satisfaction and coherence. Rules are proposed to express key aspects of the general logical behaviour of imperative constructions. A key objective is for the framework to allow patterns of behaviour to be described while avoiding making any commitments about how co...... hiện toàn bộ
Normal and non-normal classes and the set-theoretical and the mereological concept of class
Studia Logica - Tập 22 - Trang 94-95 - 1968
Z. Kraszewski, R. Suszko
Logical matrices and non-structural consequence operators
Studia Logica - Tập 42 - Trang 33-42 - 1983
Brunetto Piochi
In the present paper, we study some properties of matrices for non-structural consequence operators. These matrices were introduced in a former work (see [3]). In sections 1. and 2., general definitions and theorems are recalled; in section 3. a correspondence is studied, among our matrices and Wójcicki's ones for structural operators. In section 4. a theorem is given about operators, induced by s...... hiện toàn bộ
Algebraic logic for classical conjunction and disjunction
Studia Logica - Tập 52 - Trang 181-181 - 1993
J. M. Font, V. Verdú
Coherence and Computational Complexity of Quantifier-free Dependence Logic Formulas
Studia Logica - Tập 101 - Trang 267-291 - 2013
Jarmo Kontinen
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
С. Лущебска-Романова
Tableaus for many-valued modal logic
Studia Logica - Tập 55 - Trang 63-87 - 1995
Melvin Fitting
We continue a series of papers on a family of many-valued modal logics, a family whose Kripke semantics involves many-valued accessibility relations. Earlier papers in the series presented a motivation in terms of a multiple-expert semantics. They also proved completeness of sequent calculus formulations for the logics, formulations using a cut rule in an essential way. In this paper a novel cut-f...... hiện toàn bộ
Tŀumaczenie w sensie psychologicznym i metodologicznym
Studia Logica - Tập 9 Số 1 - Trang 245-256 - 1960
Tổng số: 2,253   
  • 1
  • 2
  • 3
  • 4
  • 5
  • 6
  • 10