Research Article10.1007/s11225-025-10226-5Carl J. Posy, Mathematical Intuitionism, part of series: Cambridge Elements in the Philosophy of Mathematics, Cambridge University Press, 2020; 10.1017/9781108674485.Mar 19, 2026Studia LogicaB BentzenCiteListenSave
Research Article10.1007/s11225-025-10218-5Nested Indirect Proofs in Aristotle’s Deductive LogicFeb 18, 2026Studia LogicaMelissa Antonelli + 1 more +1Abstract Aristotle’s Analytica Priora contains three systems of syllogistic proof, what are known as ‘figures’ 1–3. Aristotle states that all syllogistic inferences reduce to the first one but does not carry that through. It turns out that this reduction hides up to three nested instances of indirect proof. Syllogistic derivations are given as two-dimensional derivation trees—the only addition of substance to Aristotle’s proofs—with the result that nested indirect proofs can be resolved into a single such step, in perfect analogy to steps of normalization in natural deduction.Read moreCiteListenSave
Research Article10.1007/s11225-025-10213-wSplit Interpolation Refining Craig’s Theorem via Three-Valued LogicsNov 08, 2025Studia LogicaQuentin BlometCiteListenSave
Research Article110.1007/s11225-025-10207-8Two Types of Filtrations for $${\textsc {wK4}}$$ and Its RelativesOct 04, 2025Studia LogicaAndrey Kudinov + 1 more +1CiteListenSave
Research Article10.1007/s11225-025-10211-yBelnap and the Uniqueness of NegationSep 20, 2025Studia LogicaPeter MilneAbstract We take a close look at what is required to show the uniqueness of connectives in something very like Belnap’s sense. We find that negation demands more than conjunction, disjunction and the conditional. However, what it demands is quite in line with how we think of negation in a natural language but perhaps not in a formal language.Read moreCiteListenSave
Research Article10.1007/s11225-025-10190-0Densification in Classes of Involutive Commutative Residuated LatticesJul 07, 2025Studia LogicaSándor JeneiAbstract The representation theorem for odd or even involutive FL $$_e$$ e -chains via bunches of layer groups, as presented in [12], has been refined to reveal a more direct constructional relationship between these chains and bunches of layer groups, entirely circumventing the intermediary notion of layer algebras. Leveraging this refinement, it is demonstrated that both the variety of semilinear odd involutive FL $$_e$$ e -algebras and its idempotent symmetric subvariety admit densification. Finally, by applying the algebraic techniques developed in [14], the strong standard completeness of Involutive Uninorm Logic with Fixed Point ( $$\textbf{IUL}^{fp}$$ IUL fp ) is established, thereby strenghtening the main result of [11].Read moreCiteListenSave
Research Article10.1007/s11225-025-10182-0From Jaśkowski’s Discussive Logic to Contemporary Paraconsistent SystemsMay 26, 2025Studia LogicaMarek Nasieniewski + 1 more +1CiteListenSave
Research Article10.1007/s11225-025-10186-wA Unified Relational Semantics for BPL, IPL and OL: Axiomatization Without DisjunctionMay 26, 2025Studia LogicaZhicheng ChenCiteListenSave
Research Article10.1007/s11225-025-10188-8Topological Classes of MV-AlgebrasMay 26, 2025Studia LogicaGiuseppina Barbieri + 2 more +2Abstract This paper is concerned with the properties of the prime spectrum of MV-algebras, namely the space of its prime ideals with the Zariski topology which is an important topological invariant of MV-algebras. The prime spectrum is a complete invariant in Boolean algebras, but in MV-algebras this is not the case. Nevertheless knowledge of the prime spectrum gives a lot of information: There are many properties of MV-algebras which depend only on the spectrum. We call these properties “topological” and we study them. For instance, we prove that simplicity and strong simplicity are topological as well as the class of hyperarchimedean MV-algebras and the class of regular MV-algebras, while the class of perfect MV-algebras and algebraically closed are not.Read moreCiteListenSave
Research Article10.1007/s11225-025-10178-wProbability-Based ContractionMay 14, 2025Studia LogicaSven Ove HanssonAbstract Models employing hyperreal probabilities can be used to represent epistemic agents that have both credences (represented by propositions whose probability has a non-unit standard part) and full beliefs (represented by propositions with a probability at most infinitesimally smaller than 1). This article introduces operations of belief contraction in such models. Contraction is a process in which a proposition that was initially fully believed becomes a credence. We investigate two operations for such probability-based belief contraction. The first operation, which employs Jeffrey revision, gives rise to an operation that is close to the AGM operation of full meet contraction. The second, somewhat more complex, operation is of a more general type, and has AGM partial meet contraction as a special case. In both models, standard relations of epistemic entrenchment can be constructed from the probability function, which reveals a possibly somewhat surprising connection between probability and epistemic entrenchment.Read moreCiteListenSave