• Stud. Log. (IF 0.674) Pub Date : 2021-01-18
Małgorzata Kruszelnicka

The aim of this paper is to introduce the notion of a game for intuitionistic first-order Kripke models. We also establish links between notions presented here and the notions of logical equivalence and bounded bisimulation for intuitionistic first-order Kripke models, and the Ehrenfeucht–Fraïssé game for classical first-order structures.

更新日期：2021-01-18
• Stud. Log. (IF 0.674) Pub Date : 2021-01-13
Andrzej Indrzejczak

The paper presents a uniform proof-theoretic treatment of several kinds of free logic, including the logics of existence and definedness applied in constructive mathematics and computer science, and called here quasi-free logics. All free and quasi-free logics considered are formalised in the framework of sequent calculus, the latter for the first time. It is shown that in all cases remarkable simplifications

更新日期：2021-01-14
• Stud. Log. (IF 0.674) Pub Date : 2020-11-16
Mirjana Ilić

This paper presents a sequent calculus for the positive relevant logic with necessity and a proof that it admits the elimination of cut.

更新日期：2020-11-16
• Stud. Log. (IF 0.674) Pub Date : 2020-10-17
Igor Sedlár, Andrew Tedder

We, the authors, would like to thank Guillaume Aucher for informing us of his “Displaying Updates in Logic”, published in the Journal of Logic and Computation, 26(6):1865-1912 (2016).

更新日期：2020-10-17
• Stud. Log. (IF 0.674) Pub Date : 2020-10-07
Hans van Ditmarsch, Tim French, James Hales

Arbitrary public announcement logic ($$APAL$$) reasons about how the knowledge of a set of agents changes after true public announcements and after arbitrary announcements of true epistemic formulas. We consider a variant of arbitrary public announcement logic called positive arbitrary public announcement logic ($$APAL ^+$$), which restricts arbitrary public announcements to announcement of positive

更新日期：2020-10-07
• Stud. Log. (IF 0.674) Pub Date : 2020-09-30
Yuanlei Lin, Minghui Ma

The language of Belnap–Dunn modal logic $${\mathscr {L}}_0$$ expands the language of Belnap–Dunn four-valued logic (having constant symbols for the values 0 and 1) with the modal operator $$\Box$$. We introduce the polarity semantics for $${\mathscr {L}}_0$$ and its two expansions $${\mathscr {L}}_1$$ and $${\mathscr {L}}_2$$ with value operators. The local finitary consequence relation $$\models 更新日期：2020-10-02 • Stud. Log. (IF 0.674) Pub Date : 2020-09-18 Matteo Tesi C. I. Lewis’ systems were the first axiomatisations of modal logics. However some of those systems are non-normal modal logics, since they do not admit a full rule of necessitation, but only a restricted version thereof. We provide G3-style labelled sequent calculi for Lewis’ non-normal propositional systems. The calculi enjoy good structural properties, namely admissibility of structural rules and 更新日期：2020-09-20 • Stud. Log. (IF 0.674) Pub Date : 2020-09-17 Philippe Balbiani, Tatyana Ivanova In topological spaces, the relation of extended contact is a ternary relation that holds between regular closed subsets A, B and D if the intersection of A and B is included in D. The algebraic counterpart of this mereotopological relation is the notion of extended contact algebra which is a Boolean algebra extended with a ternary relation. In this paper, we are interested in the relational representation 更新日期：2020-09-18 • Stud. Log. (IF 0.674) Pub Date : 2020-09-05 Yale Weiss I show that the lattice of the positive integers ordered by division is characteristic for Urquhart’s positive semilattice relevance logic; that is, a formula is valid in positive semilattice relevance logic if and only if it is valid in all models over the positive integers ordered by division. I show that the same frame is characteristic for positive intuitionistic logic, where the class of models 更新日期：2020-09-07 • Stud. Log. (IF 0.674) Pub Date : 2020-08-31 Ramon Jansana, Tommaso Moraschini A logic in a finite language is said to be finitely presentable if it is axiomatized by finitely many finite rules. It is proved that binary non-indexed products of logics that are both finitely presentable and finitely equivalential are essentially finitely presentable. This result does not extend to binary non-indexed products of arbitrary finitely presentable logics, as shown by a counterexample 更新日期：2020-09-01 • Stud. Log. (IF 0.674) Pub Date : 2020-08-28 John Grant The first mention of the concept of an inconsistency measure for sets of formulas in first-order logic was given in 1978, but that paper presented only classifications for them. The first actual inconsistency measure with a numerical value was given in 2002 for sets of formulas in propositional logic. Since that time, researchers in logic and AI have developed a substantial theory of inconsistency 更新日期：2020-08-28 • Stud. Log. (IF 0.674) Pub Date : 2020-07-28 Igor Sedlár, Andrew Tedder We study an expansion of the Distributive Non-associative Lambek Calculus with conjugates of the Lambek product operator and residuals of those conjugates. The resulting logic is well-motivated, under-investigated and difficult to tackle. We prove completeness for some of its fragments and establish that it is decidable. Completeness of the logic is an open problem; some difficulties with applying 更新日期：2020-07-28 • Stud. Log. (IF 0.674) Pub Date : 2020-07-15 S. Negri, E. Pavlović A sequent calculus methodology for systems of agency based on branching-time frames with agents and choices is proposed, starting with a complete and cut-free system for multi-agent deliberative STIT; the methodology allows a transparent justification of the rules, good structural properties, analyticity, direct completeness and decidability proofs. 更新日期：2020-07-15 • Stud. Log. (IF 0.674) Pub Date : 2020-07-09 S. Jockwich Martinez, G. Venturi This paper contributes to the generalization of lattice-valued models of set theory to non-classical contexts. First, we show that there are infinitely many complete bounded distributive lattices, which are neither Boolean nor Heyting algebra, but are able to validate the negation-free fragment of \(\mathsf {ZF}$$. Then, we build lattice-valued models of full $$\mathsf {ZF}$$, whose internal logic

更新日期：2020-07-09
• Stud. Log. (IF 0.674) Pub Date : 2020-06-30
Jürgen Landes

The application of the maximum entropy principle to determine probabilities on finite domains is well-understood. Its application to infinite domains still lacks a well-studied comprehensive approach. There are two different strategies for applying the maximum entropy principle on first-order predicate languages: (i) applying it to finite sublanguages and taking a limit; (ii) comparing finite entropies

更新日期：2020-06-30
• Stud. Log. (IF 0.674) Pub Date : 2020-06-24
Kentarô Yamamoto

We investigate the role of coalgebraic predicate logic, a logic for neighborhood frames first proposed by Chang, in the study of monotonic modal logics. We prove analogues of the Goldblatt–Thomason theorem and Fine’s canonicity theorem for classes of monotonic neighborhood frames closed under elementary equivalence in coalgebraic predicate logic. The elementary equivalence here can be relativized to

更新日期：2020-06-24
• Stud. Log. (IF 0.674) Pub Date : 2020-06-08
Ricardo Oscar Rodriguez, Amanda Vidal

In this paper we consider the modal logic with both $$\Box$$ and $$\Diamond$$ arising from Kripke models with a crisp accessibility and whose propositions are valued over the standard Gödel algebra $$[0,1]_G$$. We provide an axiomatic system extending the one from Caicedo and Rodriguez (J Logic Comput 25(1):37–55, 2015) for models with a valued accessibility with Dunn axiom from positive modal logics

更新日期：2020-06-08
• Stud. Log. (IF 0.674) Pub Date : 2020-05-25
Rob Arthan, Paulo Oliva

This paper presents an algebraic framework for investigating proposed translations of classical logic into intuitionistic logic, such as the four negative translations introduced by Kolmogorov, Gödel, Gentzen and Glivenko. We view these as variant semantics and present a semantic formulation of Troelstra’s syntactic criteria for a satisfactory negative translation. We consider how each of the above-mentioned

更新日期：2020-05-25
• Stud. Log. (IF 0.674) Pub Date : 2020-04-21
A. Lewis-Smith, P. Oliva, E. Robinson

This paper proposes a generalization of the Kripke semantics of intuitionistic logic IL appropriate for intuitionistic Łukasiewicz logicIŁL —a logic in the intersection between IL and (classical) Łukasiewicz logic. This generalised Kripke semantics is based on the poset sum construction, used in Bova and Montagna (Theoret Comput Sci 410(12):1143–1158, 2009). to show the decidability (and PSPACE completeness)

更新日期：2020-04-21
• Stud. Log. (IF 0.674) Pub Date : 2020-04-02
AnneMarie Borg, Christian Straßer, Ofer Arieli

In this paper we introduce hypersequent-based frameworks for the modelling of defeasible reasoning by means of logic-based argumentation and the induced entailment relations. These structures are an extension of sequent-based argumentation frameworks, in which arguments and the attack relations among them are expressed not only by Gentzen-style sequents, but by more general expressions, called hypersequents

更新日期：2020-04-02
• Stud. Log. (IF 0.674) Pub Date : 2020-04-02
A. V. Figallo, G. Pelaitay, J. Sarmiento

Ewald considered tense operators G, H, F and P on intuitionistic propositional calculus and constructed an intuitionistic tense logic system called IKt. In 2014, Figallo and Pelaitay introduced the variety IKt of IKt-algebras and proved that the IKt system has IKt-algebras as algebraic counterpart. In this paper, we introduce and study the variety of tense Nelson algebras. First, we give some examples

更新日期：2020-04-02
• Stud. Log. (IF 0.674) Pub Date : 2020-02-24
Sergey Drobyshevich

We develop a general theory of FDE-based modal logics. Our framework takes into account the four-valued nature of FDE by considering four partially defined modal operators corresponding to conditions for verifying and falsifying modal necessity and possibility operators. The theory comes with a uniform characterization for all obtained systems in terms of FDE-style formula-formula sequents. We also

更新日期：2020-02-24
• Stud. Log. (IF 0.674) Pub Date : 2020-02-22
Ben Middleton

I build a canonical model for constant domain basic first-order logic ($$\textsf {BQL}_{\textsf {CD}}$$), the constant domain first-order extension of Visser’s basic propositional logic, and use the canonical model to verify that $$\textsf {BQL}_{\textsf {CD}}$$ satisfies the disjunction and existence properties.

更新日期：2020-02-22
• Stud. Log. (IF 0.674) Pub Date : 2020-02-05
Robert Goldblatt

A fundamental result from Boolean modal logic states that a first-order definable class of Kripke frames defines a logic that is validated by all of its canonical frames. We generalise this to the level of non-distributive logics that have a relational semantics provided by structures based on polarities. Such structures have associated complete lattices of stable subsets, and these have been used

更新日期：2020-02-05
• Stud. Log. (IF 0.674) Pub Date : 2020-01-22
T. D. P. Brunet, E. Fisher

We begin with the idea that lines of reasoning are continuous mental processes and develop a notion of continuity in proof. This requires abstracting the notion of a proof as a set of sentences ordered by provability. We can then distinguish between discrete steps of a proof and possibly continuous stages, defining indexing functions to pick these out. Proof stages can be associated with the application

更新日期：2020-01-22
• Stud. Log. (IF 0.674) Pub Date : 2020-01-21
Bernhard Heinemann

In this paper, a particular extension of the constitutive bi-modal logic for single-agent subset spaces will be provided. That system, which originally was designed for revealing the intrinsic relationship between knowledge and topology, has been developed in several directions in recent years, not least towards a comprehensive knowledge-theoretic formalism. This line is followed here to the extent

更新日期：2020-01-21
• Stud. Log. (IF 0.674) Pub Date : 2020-01-18
Krystyna Mruczek-Nasieniewska, Marek Nasieniewski

In the context of modal logics one standardly considers two modal operators: possibility ($$\Diamond$$) and necessity ($$\Box$$) [see for example Chellas (Modal logic. An introduction, Cambridge University Press, Cambridge, 1980)]. If the classical negation is present these operators can be treated as inter-definable. However, negative modalities ($$\Diamond \lnot$$) and ($$\Box \lnot$$) are also

更新日期：2020-01-18
• Stud. Log. (IF 0.674) Pub Date : 2020-01-09
Sándor Jenei

Hahn’s embedding theorem asserts that linearly ordered abelian groups embed in some lexicographic product of real groups. Hahn’s theorem is generalized to a class of residuated semigroups in this paper, namely, to odd involutive commutative residuated chains which possess only finitely many idempotent elements. To this end, the partial lexicographic product construction is introduced to construct new

更新日期：2020-01-09
• Stud. Log. (IF 0.674) Pub Date : 2020-01-09
Edoardo Rivello

In Hannes Leitgeb’s article What truth depends on (Leitgeb in J Philos Logic 34:155–192, 2005) the author provides a formally correct and materially adequate truth definition for the set of all grounded sentences, defined as the least fixed point of a monotone operator of semantic dependence. In this paper we will focus on the mathematical aspects of Leitgeb’s notions of dependence, grounding and truth

更新日期：2020-01-09
• Stud. Log. (IF 0.674) Pub Date : 2019-12-19
Hirohiko Kushida

In a classical 1976 paper, Solovay proved the arithmetical completeness of the modal logic GL; provability of a formula in GL coincides with provability of its arithmetical interpretations of it in Peano Arithmetic. In that paper, he also provided an axiomatic system GLS and proved arithmetical completeness for GLS; provability of a formula in GLS coincides with truth of its arithmetical interpretations

更新日期：2019-12-19
• Stud. Log. (IF 0.674) Pub Date : 2019-12-07
Denis I. Saveliev, Ilya B. Shapirovsky

Given a class $$\mathcal {C}$$ of models, a binary relation $$\mathcal {R}$$ between models, and a model-theoretic language L, we consider the modal logic and the modal algebra of the theory of $$\mathcal {C}$$ in L where the modal operator is interpreted via $$\mathcal {R}$$. We discuss how modal theories of $$\mathcal {C}$$ and $$\mathcal {R}$$ depend on the model-theoretic language, their Kripke

更新日期：2019-12-07
• Stud. Log. (IF 0.674) Pub Date : 2019-12-05
Giacomo Bonanno

We consider a basic logic with two primitive uni-modal operators: one for certainty and the other for plausibility. The former is assumed to be a normal operator (corresponding—semantically—to a binary Kripke relation), while the latter is merely a classical operator (corresponding—semantically—to a neighborhood function). We then define belief, interpreted as “maximally plausible possibility”, in

更新日期：2019-12-05
• Stud. Log. (IF 0.674) Pub Date : 2019-12-03
Marek Nowak

Two different kinds of multiple-conclusion consequence relations taken from Shoesmith and Smiley (Multiple-conclusion logic, Cambridge University Press, Cambridge, 1978) and Galatos and Tsinakis (J Symb Logic 74:780–810, 2009) or Nowak (Bull Sect Logic 46:219–232, 2017), called here disjunctive and conjunctive, respectively, defined on a formal language, are considered. They are transferred into a

更新日期：2019-12-03
• Stud. Log. (IF 0.674) Pub Date : 2019-11-14
José Gil-Férez, Frederik Möllerström Lauridsen, George Metcalfe

A residuated lattice is said to be integrally closed if it satisfies the quasiequations $$xy \le x \implies y \le {\mathrm {e}}$$ and $$yx \le ~x \implies y \le {\mathrm {e}}$$, or equivalently, the equations $$x \backslash x \approx {\mathrm {e}}$$ and $$x /x \approx {\mathrm {e}}$$. Every integral, cancellative, or divisible residuated lattice is integrally closed, and, conversely, every bounded

更新日期：2019-11-14
• Stud. Log. (IF 0.674) Pub Date : 2019-11-12
Philippe Balbiani, Çiğdem Gencer

The unification problem in a normal modal logic is to determine, given a formula $$\varphi$$, whether there exists a substitution $$\sigma$$ such that $$\sigma (\varphi )$$ is in that logic. In that case, $$\sigma$$ is a unifier of $$\varphi$$. We shall say that a set of unifiers of a unifiable formula $$\varphi$$ is minimal complete if for all unifiers $$\sigma$$ of $$\varphi$$, there exists

更新日期：2019-11-12
• Stud. Log. (IF 0.674) Pub Date : 2019-11-10
Diderik Batens

This paper defines provably non-trivial theories that characterize Frege’s notion of a set, taking into account that the notion is inconsistent. By choosing an adaptive underlying logic, consistent sets behave classically notwithstanding the presence of inconsistent sets. Some of the theories have a full-blown presumably consistent set theory T as a subtheory, provided T is indeed consistent. An unexpected

更新日期：2019-11-10
• Stud. Log. (IF 0.674) Pub Date : 2019-11-01
Satoru Niki

We investigate a subsystem of minimal logic related to D. Vakarelov’s logic $$\mathbf {SUBMIN}$$, using the framework of subminimal logics by A. Colacito, D. de Jongh and A. L. Vargas. In the course of it, the relationship between the two semantics in the respective frameworks is clarified. In addition, we introduce a sequent calculus for the investigated subsystem, and some proof-theoretic properties

更新日期：2019-11-01
• Stud. Log. (IF 0.674) Pub Date : 2019-10-24

Inspired by recent work on proof theory for modal logic, this paper develops a cut-free labelled sequent calculus obtained by imitating Herzberger’s limit rule for revision sequences as a clause in a possible world semantics. With the help of two completeness theorems, one between the labelled sequent calculus and the corresponding possible world semantics, and one between the axiomatic theory of truth

更新日期：2019-10-24
• Stud. Log. (IF 0.674) Pub Date : 2019-10-24
Francesco Paoli, Michele Pra Baldi

Paraconsistent Weak Kleene Logic (PWK) is the 3-valued propositional logic defined on the weak Kleene tables and with two designated values. Most of the existing proof systems for PWK are characterised by the presence of linguistic restrictions on some of their rules. This feature can be seen as a shortcoming. We provide a cut-free calculus (a hybrid between a natural deduction calculus and a sequent

更新日期：2019-10-24
• Stud. Log. (IF 0.674) Pub Date : 2019-10-22
Yuanlei Lin, Minghui Ma

The minimal weakening $${{\textsf {N}}}_0$$ of Belnap-Dunn logic under the polarity semantics for negation as a modal operator is formulated as a sequent system which is characterized by the class of all birelational frames. Some extensions of $${{\textsf {N}}}_0$$ with additional sequents as axioms are introduced. In particular, all three modal negation logics characterized by a frame with a single

更新日期：2019-10-22
• Stud. Log. (IF 0.674) Pub Date : 2019-10-14
Charles McCarty

Satisfiability or Sat$$^{1}$$ is the metatheoretic statement Every formally intuitionistically consistent set of first-order sentences has a model. The models in question are the Tarskian relational structures familiar from standard first-order model theory (Chang and Keisler in Model theory, 3rd edn, Dover Publications Inc., Mineola, 2012), but here treated within intuitionistic metamathematics. We

更新日期：2019-10-14
• Stud. Log. (IF 0.674) Pub Date : 2019-09-16
Réka Markovich

Hohfeld’s analysis ( Fundamental Legal Conceptions as Applied in Judicial Reasoning , 1913, 1917) on the different types of rights and duties is highly influential in analytical legal theory, and it is considered as a fundamental theory in AI&Law and normative multi-agent systems. Yet a century later, the formalization of this theory remains, in various ways, unresolved. In this paper I provide a formal

更新日期：2019-09-16
• Stud. Log. (IF 0.674) Pub Date : 2019-08-24
Wolfgang Rump, Xia Zhang

L-effect algebras are introduced as a class of L-algebras which specialize to all known generalizations of effect algebras with a $$\wedge$$-semilattice structure. Moreover, L-effect algebras X arise in connection with quantum sets and Frobenius algebras. The translates of X in the self-similar closure S(X) form a covering, and the structure of X is shown to be equivalent to the compatibility of overlapping

更新日期：2019-08-24
• Stud. Log. (IF 0.674) Pub Date : 2019-08-21
Ted Shear, John Quiggin

Justification logics are a family of modal logics whose non-normal modalities are parametrised by a type-theoretic calculus of terms. The first justification logic was developed by Sergei Artemov to provide an explicit modal logic for arithmetical provability in which these terms were taken to pick out proofs. But, justification logics have been given various other interpretations as well. In this

更新日期：2019-08-21
• Stud. Log. (IF 0.674) Pub Date : 2019-08-01
Nicholas Pischke

Justification logics are special kinds of modal logics which provide a framework for reasoning about epistemic justifications. For this, they extend classical boolean propositional logic by a family of necessity-style modal operators “t : ”, indexed over t by a corresponding set of justification terms, which thus explicitly encode the justification for the necessity assertion in the syntax. With these

更新日期：2019-08-01
• Stud. Log. (IF 0.674) Pub Date : 2019-07-24
Marta Bílková, Almudena Colacito

Proof-theoretic methods are developed for subsystems of Johansson’s logic obtained by extending the positive fragment of intuitionistic logic with weak negations. These methods are exploited to establish properties of the logical systems. In particular, cut-free complete sequent calculi are introduced and used to provide a proof of the fact that the systems satisfy the Craig interpolation property

更新日期：2019-07-24
• Stud. Log. (IF 0.674) Pub Date : 2019-07-06
Guido Gherardi, Paolo Maffezioli, Eugenio Orlandelli

We prove a generalization of Maehara’s lemma to show that the extensions of classical and intuitionistic first-order logic with a special type of geometric axioms, called singular geometric axioms, have Craig’s interpolation property. As a corollary, we obtain a direct proof of interpolation for (classical and intuitionistic) first-order logic with identity, as well as interpolation for several mathematical

更新日期：2019-07-06
• Stud. Log. (IF 0.674) Pub Date : 2019-05-16
Taishi Kurahashi

In this paper, we investigate Rosser provability predicates whose provability logics are normal modal logics. First, we prove that there exists a Rosser provability predicate whose provability logic is exactly the normal modal logic $$\mathsf{KD}$$. Secondly, we introduce a new normal modal logic $$\mathsf{KDR}$$ which is a proper extension of $$\mathsf{KD}$$, and prove that there exists a Rosser provability

更新日期：2019-05-16
• Stud. Log. (IF 0.674) Pub Date : 2019-05-10
Norihiro Kamide, Yoni Zohar

In this study, we prove the completeness and cut-elimination theorems for a first-order extension F4CC of Arieli, Avron, and Zamansky’s ideal paraconsistent four-valued logic known as 4CC. These theorems are proved using Schütte’s method, which can simultaneously prove completeness and cut-elimination.

更新日期：2019-05-10
• Stud. Log. (IF 0.674) Pub Date : 2019-05-02
Albert Anglberger,Johannes Korbmacher

By building on work by Kit Fine, we develop a sound and complete truthmaker semantics for Lou Goble’s conflict tolerant deontic logic $$\mathbf {BDL}$$.

更新日期：2019-05-02
• Stud. Log. (IF 0.674) Pub Date : 2019-04-20
Neil Barton, Andrés Eduardo Caicedo, Gunter Fuchs, Joel David Hamkins, Jonas Reitz, Ralf Schindler

We introduce and consider the inner-model reflection principle, which asserts that whenever a statement $$\varphi (a)$$ in the first-order language of set theory is true in the set-theoretic universe V, then it is also true in a proper inner model $$W\subsetneq V$$. A stronger principle, the ground-model reflection principle, asserts that any such $$\varphi (a)$$ true in V is also true in some non-trivial

更新日期：2019-04-20
• Stud. Log. (IF 0.674) Pub Date : 2019-04-12
Michael Arndt

A calculus for classical propositional sequents is introduced that consists of a restricted version of the cut rule and local variants of the logical rules. Employed in the style of proof search, this calculus explodes a given sequent into its elementary structural sequents—the topmost sequents in a derivation thus constructed—which do not contain any logical constants. Some of the properties exhibited

更新日期：2019-04-12
• Stud. Log. (IF 0.674) Pub Date : 2019-03-27
José Espírito Santo, Gilda Ferreira

We study an alternative embedding of IPC into atomic system F whose translation of proofs is based, not on instantiation overflow, but instead on the admissibility of the elimination rules for disjunction and absurdity (where these connectives are defined according to the Russell–Prawitz translation). As compared to the embedding based on instantiation overflow, the alternative embedding works equally

更新日期：2019-03-27
• Stud. Log. (IF 0.674) Pub Date : 2019-03-19
Andrzej Pietruszczak, Mateusz Klonowski, Yaroslav Petrukhin

Pietruszczak (Bull Sect Log 38(3/4):163–171, 2009. https://doi.org/10.12775/LLP.2009.013) proved that the normal logics $$\mathrm {K45}$$, $$\mathrm {KB4}$$ ($$=\mathrm {KB5}$$), $$\mathrm {KD45}$$ are determined by suitable classes of simplified Kripke frames of the form $$\langle W,A\rangle$$, where $$A\subseteq W$$. In this paper, we extend this result. Firstly, we show that a modal logic is determined

更新日期：2019-03-19
• Stud. Log. (IF 0.674) Pub Date : 2019-03-18
Yongfeng Yuan

This article reveals one general scheme for creating counter examples to Bayesian confirmation theory. The reason of the problems is that: in daily life the degree of confirmation is affected not only by probability but also by some non-probabilistic factors, e.g., structural similarity, quantity of evidence, and marginal utility, while Bayesian confirmation theory considers only probabilities to measure

更新日期：2019-03-18
• Stud. Log. (IF 0.674) Pub Date : 2019-03-05
Dominik Klein,Alessandra Marra

This paper focuses on (an interpretation of) the Enkratic principle of rationality, according to which rationality requires that if an agent sincerely and with conviction believes she ought to X , then X -ing is a goal in her plan. We analyze the logical structure of Enkrasia and its implications for deontic logic. To do so, we elaborate on the distinction between basic and derived oughts, and provide

更新日期：2019-03-05
• Stud. Log. (IF 0.674) Pub Date : 2019-02-20
Michael Schippers, Jakob Koscholke

Coherence is a property of propositions hanging together or dovetailing with each other. About two decades ago, formal epistemologists started to engage in the project of explicating the seemingly elusive concept of coherence by means of probability theory. Since then, a plethora of coherence measures have been discussed in the literature. In this paper, we propose a general framework for coherence

更新日期：2019-02-20
• Stud. Log. (IF 0.674) Pub Date : 2019-02-19

KR is Anderson and Belnap’s relevance logic R with the addition of the axiom of EFQ: $$(p \,\, \& \sim p) \rightarrow q$$. Since KR is relevantistic as to implication but classical as to negation, it has been dubbed, among many others, a ‘classical relevance logic.’ For KR, there have been known so far just two pretabular normal extensions. For these pretabular logics, no simple axiomatizations have

更新日期：2019-02-19
• Stud. Log. (IF 0.674) Pub Date : 2019-02-18
Marcello D’Agostino, Dov Gabbay, Sanjay Modgil

In this paper we provide a detailed proof-theoretical analysis of a natural deduction system for classical propositional logic that (i) represents classical proofs in a more natural way than standard Gentzen-style natural deduction, (ii) admits of a simple normalization procedure such that normal proofs enjoy the Weak Subformula Property, (iii) provides the means to prove a Non-contamination Property

更新日期：2019-02-18
• Stud. Log. (IF 0.674) Pub Date : 2019-02-12
Giorgio Venturi

In this article we present a technique for selecting models of set theory that are complete in a model-theoretic sense. Specifically, we will apply Robinson infinite forcing to the collections of models of ZFC obtained by Cohen forcing. This technique will be used to suggest a unified perspective on generic absoluteness principles.

更新日期：2019-02-12
Contents have been reproduced by permission of the publishers.

down
wechat
bug