A Relevant Logic of Questions
 Author: Error: Author not contained in standard '<author>' tag in feed
 Publication date: 20201001
Abstract:
This paper introduces the inquisitive extension of R, denoted as InqR, which is a relevant logic of questions based on the logic R as the background logic of declaratives. A semantics for InqR is developed, and it is shown that this semantics is, in a precisely defined sense, dual to RoutleyMeyer semantics for R. Moreover, InqR is axiomatized and completeness of the axiomatic system is established. The philosophical interpretation of the duality between RoutleyMeyer semantics and the semantics for InqR is also discussed. Word Count:
Rank  Word  Count 
0  semantics  5 
Excerpts:
...as the background logic of declaratives a semantics for inqr is developed and it is ...
...developed and it is shown that this semantics is in a precisely defined sense dual ...
...a precisely defined sense dual to routleymeyer semantics for r moreover inqr is axiomatized and ...
...philosophical interpretation of the duality between routleymeyer semantics and the semantics for inqr is also ...
...the duality between routleymeyer semantics and the semantics for inqr is also discussed ...

1  inqr  4 
Excerpts:
...the inquisitive extension of r denoted as inqr which is a relevant logic of questions ...
...background logic of declaratives a semantics for inqr is developed and it is shown that ...
...dual to routleymeyer semantics for r moreover inqr is axiomatized and completeness of the axiomatic ...
...between routleymeyer semantics and the semantics for inqr is also discussed ...

2  r  3 
Excerpts:
...this paper introduces the inquisitive extension of r denoted as inqr which is a relevant ...
...logic of questions based on the logic r as the background logic of declaratives a ...
...defined sense dual to routleymeyer semantics for r moreover inqr is axiomatized and completeness of ...

3  logic  3 
Excerpts:
...denoted as inqr which is a relevant logic of questions based on the logic r ...
...relevant logic of questions based on the logic r as the background logic of declaratives ...
...on the logic r as the background logic of declaratives a semantics for inqr is ...

4  routleymeyer  2 
Excerpts:
...in a precisely defined sense dual to routleymeyer semantics for r moreover inqr is axiomatized ...
...the philosophical interpretation of the duality between routleymeyer semantics and the semantics for inqr is ...

5  introduces  1 
Excerpts:
... this paper introduces the inquisitive extension of r denoted as ...

6  dual  1 
Excerpts:
...semantics is in a precisely defined sense dual to routleymeyer semantics for r moreover inqr ...

7  duality  1 
Excerpts:
...is established the philosophical interpretation of the duality between routleymeyer semantics and the semantics for ...

8  interpretation  1 
Excerpts:
...the axiomatic system is established the philosophical interpretation of the duality between routleymeyer semantics and ...

9  philosophical  1 
Excerpts:
...of the axiomatic system is established the philosophical interpretation of the duality between routleymeyer semantics ...

Infinitesimal Gunk
 Author: Error: Author not contained in standard '<author>' tag in feed
 Publication date: 20201001
Abstract:
In this paper, I advance an original view of the structure of space called Infinitesimal Gunk. This view says that every region of space can be further divided and some regions have infinitesimal size, where infinitesimals are understood in the framework of Robinson's (1966) nonstandard analysis. This view, I argue, provides a novel reply to the inconsistency arguments proposed by Arntzenius (2008) and Russell (2008), which have troubled a more familiar gunky approach. Moreover, it has important advantages over the alternative views these authors suggested. Unlike Arntzenius's proposal, it does not introduce regions with no interior. It also has a much richer measure theory than Russell's proposal and does not retreat to mere finite additivity. Word Count:
Rank  Word  Count 
0  does  2 
Excerpts:
...these authors suggested unlike arntzeniuss proposal it does not introduce regions with no interior it ...
...richer measure theory than russells proposal and does not retreat to mere finite additivity ...

1  proposal  2 
Excerpts:
...alternative views these authors suggested unlike arntzeniuss proposal it does not introduce regions with no ...
...a much richer measure theory than russells proposal and does not retreat to mere finite ...

2  space  2 
Excerpts:
...an original view of the structure of space called infinitesimal gunk this view says that ...
...this view says that every region of space can be further divided and some regions ...

3  infinitesimal  2 
Excerpts:
...view of the structure of space called infinitesimal gunk this view says that every region ...
...be further divided and some regions have infinitesimal size where infinitesimals are understood in the ...

4  regions  2 
Excerpts:
...space can be further divided and some regions have infinitesimal size where infinitesimals are understood ...
...unlike arntzeniuss proposal it does not introduce regions with no interior it also has a ...

5  approach  1 
Excerpts:
...which have troubled a more familiar gunky approach moreover it has important advantages over the ...

6  moreover  1 
Excerpts:
...have troubled a more familiar gunky approach moreover it has important advantages over the alternative ...

7  important  1 
Excerpts:
...more familiar gunky approach moreover it has important advantages over the alternative views these authors ...

8  advantages  1 
Excerpts:
...familiar gunky approach moreover it has important advantages over the alternative views these authors suggested ...

9  over  1 
Excerpts:
...gunky approach moreover it has important advantages over the alternative views these authors suggested unlike ...

Probability Modals and Infinite Domains
 Author: Error: Author not contained in standard '<author>' tag in feed
 Publication date: 20201001
Abstract:
Recent years have witnessed a proliferation of attempts to apply the mathematical theory of probability to the semantics of natural language probability talk. These sorts of probabilistic' semantics are often motivated by their ability to explain intuitions about inferences involving likely' and probably''intuitions that Angelika Kratzer's canonical semantics fails to accommodate through a semantics based solely on an ordering of worlds and a qualitative ranking of propositions. However, recent work by Wesley Holliday and Thomas Icard has been widely thought to undercut this motivation: they present a worldordering semantics that yields essentially the same logic as probabilistic semantics. In this paper, I argue that the challenge remains: defenders of worldordering semantics have yet to offer a plausible semantics that captures the logic of comparative likelihood. Holliday & Icard's semantics yields an adequate logic only if models are restricted to Noetherian preorders. But I argue that the Noetherian restriction faces problems in cases involving infinitely large domains of epistemic possibilities. As a result, probabilistic semantics remains the better explanation of the data. Word Count:
Rank  Word  Count 
0  semantics  10 
Excerpts:
...the mathematical theory of probability to the semantics of natural language probability talk these sorts ...
...language probability talk these sorts of probabilistic semantics are often motivated by their ability to ...
...likely and probablyintuitions that angelika kratzers canonical semantics fails to accommodate through a semantics based ...
...canonical semantics fails to accommodate through a semantics based solely on an ordering of worlds ...
...undercut this motivation they present a worldordering semantics that yields essentially the same logic as ...
...yields essentially the same logic as probabilistic semantics in this paper i argue that the ...
...that the challenge remains defenders of worldordering semantics have yet to offer a plausible semantics ...
...semantics have yet to offer a plausible semantics that captures the logic of comparative likelihood ...
...logic of comparative likelihood holliday amp icards semantics yields an adequate logic only if models ...
...of epistemic possibilities as a result probabilistic semantics remains the better explanation of the data ...

1  logic  3 
Excerpts:
...worldordering semantics that yields essentially the same logic as probabilistic semantics in this paper i ...
...offer a plausible semantics that captures the logic of comparative likelihood holliday amp icards semantics ...
...holliday amp icards semantics yields an adequate logic only if models are restricted to noetherian ...

2  probabilistic  3 
Excerpts:
...natural language probability talk these sorts of probabilistic semantics are often motivated by their ability ...
...that yields essentially the same logic as probabilistic semantics in this paper i argue that ...
...domains of epistemic possibilities as a result probabilistic semantics remains the better explanation of the ...

3  recent  2 
Excerpts:
... recent years have witnessed a proliferation of attempts ...
...and a qualitative ranking of propositions however recent work by wesley holliday and thomas icard ...

4  holliday  2 
Excerpts:
...of propositions however recent work by wesley holliday and thomas icard has been widely thought ...
...that captures the logic of comparative likelihood holliday amp icards semantics yields an adequate logic ...

5  worldordering  2 
Excerpts:
...to undercut this motivation they present a worldordering semantics that yields essentially the same logic ...
...argue that the challenge remains defenders of worldordering semantics have yet to offer a plausible ...

6  yields  2 
Excerpts:
...motivation they present a worldordering semantics that yields essentially the same logic as probabilistic semantics ...
...of comparative likelihood holliday amp icards semantics yields an adequate logic only if models are ...

7  remains  2 
Excerpts:
...this paper i argue that the challenge remains defenders of worldordering semantics have yet to ...
...epistemic possibilities as a result probabilistic semantics remains the better explanation of the data ...

8  noetherian  2 
Excerpts:
...logic only if models are restricted to noetherian preorders but i argue that the noetherian ...
...noetherian preorders but i argue that the noetherian restriction faces problems in cases involving infinitely ...

9  involving  2 
Excerpts:
...their ability to explain intuitions about inferences involving likely and probablyintuitions that angelika kratzers canonical ...
...the noetherian restriction faces problems in cases involving infinitely large domains of epistemic possibilities as ...

Revising Probabilities and Full Beliefs
 Author: Error: Author not contained in standard '<author>' tag in feed
 Publication date: 20201001
Abstract:
A new formal model of belief dynamics is proposed, in which the epistemic agent has both probabilistic beliefs and full beliefs. The agent has full belief in a proposition if and only if she considers the probability that it is false to be so close to zero that she chooses to disregard that probability. She treats such a proposition as having the probability 1, but, importantly, she is still willing and able to revise that probability assignment if she receives information that gives her sufficient reasons to do so. Such a proposition is (presently) undoubted, but not undoubtable (incorrigible). In the formal model it is assigned a probability 1 ˆ’ Î´, where Î´ is an infinitesimal number. The proposed model employs probabilistic belief states that contain several underlying probability functions representing alternative probabilistic states of the world. Furthermore, a distinction is made between update and revision, in the same way as in the literature on (dichotomous) belief change. The formal properties of the model are investigated, including properties relevant for learning from experience. The set of propositions whose probabilities are infinitesimally close to 1 forms a (logically closed) belief set. Operations that change the probabilistic belief state give rise to changes in this belief set, which have much in common with traditional operations of belief change. Word Count:
A Paraconsistent Conditional Logic
 Author: Error: Author not contained in standard '<author>' tag in feed
 Publication date: 20201001
Abstract:
We develop a paraconsistent logic by introducing new models for conditionals with acceptive and rejective selection functions which are variants of Chellas' conditional models. The acceptance and rejection conditions are substituted for truth conditions of conditionals. The paraconsistent conditional logic is axiomatized by a sequent system
\(\mathcal {C}\)
which is an extension of the BelnapDunn fourvalued logic with a conditional operator. Some acceptive extensions of
\(\mathcal {C}\)
are shown to be sound and complete. We also show the finite acceptive model property and decidability of these logics. Word Count:
Rank  Word  Count 
0  logic  3 
Excerpts:
... we develop a paraconsistent logic by introducing new models for conditionals with ...
...truth conditions of conditionals the paraconsistent conditional logic is axiomatized by a sequent system
...
...is an extension of the belnapdunn fourvalued logic with a conditional operator some acceptive extensions ...

1  acceptive  3 
Excerpts:
...by introducing new models for conditionals with acceptive and rejective selection functions which are variants ...
...fourvalued logic with a conditional operator some acceptive extensions of
...
...and complete we also show the finite acceptive model property and decidability of these logics ...

2  conditional  3 
Excerpts:
...selection functions which are variants of chellas conditional models the acceptance and rejection conditions are ...
...for truth conditions of conditionals the paraconsistent conditional logic is axiomatized by a sequent system ...
...of the belnapdunn fourvalued logic with a conditional operator some acceptive extensions of
...

3  mathcal  2 
Excerpts:
...system
mathcal c
...
...of
mathcal c
...

4  models  2 
Excerpts:
...develop a paraconsistent logic by introducing new models for conditionals with acceptive and rejective selection ...
...functions which are variants of chellas conditional models the acceptance and rejection conditions are substituted ...

5  conditionals  2 
Excerpts:
...paraconsistent logic by introducing new models for conditionals with acceptive and rejective selection functions which ...
...conditions are substituted for truth conditions of conditionals the paraconsistent conditional logic is axiomatized by ...

6  paraconsistent  2 
Excerpts:
... we develop a paraconsistent logic by introducing new models for conditionals ...
...substituted for truth conditions of conditionals the paraconsistent conditional logic is axiomatized by a sequent ...

7  c  2 
Excerpts:

8  conditions  2 
Excerpts:
...chellas conditional models the acceptance and rejection conditions are substituted for truth conditions of conditionals ...
...and rejection conditions are substituted for truth conditions of conditionals the paraconsistent conditional logic is ...

9  extensions  1 
Excerpts:
...logic with a conditional operator some acceptive extensions of
...

Jeffrey Meets Kolmogorov
 Author: Error: Author not contained in standard '<author>' tag in feed
 Publication date: 20201001
Abstract:
Jeffrey conditionalization is a rule for updating degrees of belief in light of uncertain evidence. It is usually assumed that the partitions involved in Jeffrey conditionalization are finite and only contain positivecredence elements. But there are interesting examples, involving continuous quantities, in which this is not the case. Q1 Can Jeffrey conditionalization be generalized to accommodate continuous cases? Meanwhile, several authors, such as Kenny Easwaran and Michael Rescorla, have been interested in Kolmogorov's theory of regular conditional distributions (rcds) as a possible framework for conditional probability which handles probabilityzero events. However the theory faces a major shortcoming: it seems messy and ad hoc. Q2 Is there some axiomatic theory which would justify and constrain the use of rcds, thus serving as a possible foundation for conditional probability? These two questions appear unrelated, but they are not, and this paper answers both. We show that when one appropriately generalizes Jeffrey conditionalization as in Q1, one obtains a framework which necessitates the use of rcds. It is then a short step to develop a general theory which addresses Q2, which we call the theory of extensions. The theory is a formal model of conditioning which recovers Bayesian conditionalization, Jeffrey conditionalization, and conditionalization via rcds as special cases. Word Count:
Rank  Word  Count 
0  conditionalization  7 
Excerpts:
... jeffrey conditionalization is a rule for updating degrees of ...
...assumed that the partitions involved in jeffrey conditionalization are finite and only contain positivecredence elements ...
...is not the case q1 can jeffrey conditionalization be generalized to accommodate continuous cases meanwhile ...
...show that when one appropriately generalizes jeffrey conditionalization as in q1 one obtains a framework ...
...formal model of conditioning which recovers bayesian conditionalization jeffrey conditionalization and conditionalization via rcds as ...
...of conditioning which recovers bayesian conditionalization jeffrey conditionalization and conditionalization via rcds as special cases ...
...which recovers bayesian conditionalization jeffrey conditionalization and conditionalization via rcds as special cases ...

1  theory  6 
Excerpts:
...michael rescorla have been interested in kolmogorovs theory of regular conditional distributions rcds as a ...
...probability which handles probabilityzero events however the theory faces a major shortcoming it seems messy ...
...ad hoc q2 is there some axiomatic theory which would justify and constrain the use ...
...a short step to develop a general theory which addresses q2 which we call the ...
...which addresses q2 which we call the theory of extensions the theory is a formal ...
...we call the theory of extensions the theory is a formal model of conditioning which ...

2  jeffrey  5 
Excerpts:
... jeffrey conditionalization is a rule for updating degrees ...
...usually assumed that the partitions involved in jeffrey conditionalization are finite and only contain positivecredence ...
...this is not the case q1 can jeffrey conditionalization be generalized to accommodate continuous cases ...
...we show that when one appropriately generalizes jeffrey conditionalization as in q1 one obtains a ...
...model of conditioning which recovers bayesian conditionalization jeffrey conditionalization and conditionalization via rcds as special ...

3  rcds  4 
Excerpts:
...in kolmogorovs theory of regular conditional distributions rcds as a possible framework for conditional probability ...
...would justify and constrain the use of rcds thus serving as a possible foundation for ...
...a framework which necessitates the use of rcds it is then a short step to ...
...bayesian conditionalization jeffrey conditionalization and conditionalization via rcds as special cases ...

4  conditional  3 
Excerpts:
...been interested in kolmogorovs theory of regular conditional distributions rcds as a possible framework for ...
...distributions rcds as a possible framework for conditional probability which handles probabilityzero events however the ...
...thus serving as a possible foundation for conditional probability these two questions appear unrelated but ...

5  continuous  2 
Excerpts:
...elements but there are interesting examples involving continuous quantities in which this is not the ...
...can jeffrey conditionalization be generalized to accommodate continuous cases meanwhile several authors such as kenny ...

6  use  2 
Excerpts:
...theory which would justify and constrain the use of rcds thus serving as a possible ...
...one obtains a framework which necessitates the use of rcds it is then a short ...

7  q2  2 
Excerpts:
...shortcoming it seems messy and ad hoc q2 is there some axiomatic theory which would ...
...to develop a general theory which addresses q2 which we call the theory of extensions ...

8  framework  2 
Excerpts:
...regular conditional distributions rcds as a possible framework for conditional probability which handles probabilityzero events ...
...conditionalization as in q1 one obtains a framework which necessitates the use of rcds it ...

9  possible  2 
Excerpts:
...of regular conditional distributions rcds as a possible framework for conditional probability which handles probabilityzero ...
...use of rcds thus serving as a possible foundation for conditional probability these two questions ...

Intuitionistic Nonnormal Modal Logics: A General Framework
 Author: Error: Author not contained in standard '<author>' tag in feed
 Publication date: 20201001
Abstract:
We define a family of intuitionistic nonnormal modal logics; they can be seen as intuitionistic counterparts of classical ones. We first consider monomodal logics, which contain only Necessity or Possibility. We then consider the more important case of bimodal logics, which contain both modal operators. In this case we define several interactions between Necessity and Possibility of increasing strength, although weaker than duality. We thereby obtain a lattice of 24 distinct bimodal logics. For all logics we provide both a Hilbert axiomatisation and a cutfree sequent calculus, on its basis we also prove their decidability. We then define a semantic characterisation of our logics in terms of neighbourhood models containing two distinct neighbourhood functions corresponding to the two modalities. Our semantic framework captures modularly not only our systems but also already known intuitionistic nonnormal modal logics such as Constructive K (CK) and the propositional fragment of Wijesekera's Constructive Concurrent Dynamic Logic. Word Count:
Rank  Word  Count 
0  logics  7 
Excerpts:
...define a family of intuitionistic nonnormal modal logics they can be seen as intuitionistic counterparts ...
...of classical ones we first consider monomodal logics which contain only necessity or possibility we ...
...consider the more important case of bimodal logics which contain both modal operators in this ...
...obtain a lattice of 24 distinct bimodal logics for all logics we provide both a ...
...of 24 distinct bimodal logics for all logics we provide both a hilbert axiomatisation and ...
...then define a semantic characterisation of our logics in terms of neighbourhood models containing two ...
...but also already known intuitionistic nonnormal modal logics such as constructive k ck and the ...

1  define  3 
Excerpts:
... we define a family of intuitionistic nonnormal modal logics ...
...both modal operators in this case we define several interactions between necessity and possibility of ...
...we also prove their decidability we then define a semantic characterisation of our logics in ...

2  intuitionistic  3 
Excerpts:
... we define a family of intuitionistic nonnormal modal logics they can be seen ...
...modal logics they can be seen as intuitionistic counterparts of classical ones we first consider ...
...only our systems but also already known intuitionistic nonnormal modal logics such as constructive k ...

3  modal  3 
Excerpts:
...we define a family of intuitionistic nonnormal modal logics they can be seen as intuitionistic ...
...case of bimodal logics which contain both modal operators in this case we define several ...
...systems but also already known intuitionistic nonnormal modal logics such as constructive k ck and ...

4  only  2 
Excerpts:
...we first consider monomodal logics which contain only necessity or possibility we then consider the ...
...modalities our semantic framework captures modularly not only our systems but also already known intuitionistic ...

5  semantic  2 
Excerpts:
...prove their decidability we then define a semantic characterisation of our logics in terms of ...
...functions corresponding to the two modalities our semantic framework captures modularly not only our systems ...

6  neighbourhood  2 
Excerpts:
...characterisation of our logics in terms of neighbourhood models containing two distinct neighbourhood functions corresponding ...
...terms of neighbourhood models containing two distinct neighbourhood functions corresponding to the two modalities our ...

7  distinct  2 
Excerpts:
...we thereby obtain a lattice of 24 distinct bimodal logics for all logics we provide ...
...in terms of neighbourhood models containing two distinct neighbourhood functions corresponding to the two modalities ...

8  constructive  2 
Excerpts:
...known intuitionistic nonnormal modal logics such as constructive k ck and the propositional fragment of ...
...ck and the propositional fragment of wijesekeras constructive concurrent dynamic logic ...

9  bimodal  2 
Excerpts:
...then consider the more important case of bimodal logics which contain both modal operators in ...
...thereby obtain a lattice of 24 distinct bimodal logics for all logics we provide both ...

Opaque Updates
 Author: Error: Author not contained in standard '<author>' tag in feed
 Publication date: 20200908
Abstract:
If updating with E has the same result across all epistemically possible worlds, then the agent has no uncertainty as to the behavior of the update, and we may call it a transparent update. If an agent is uncertain about the behavior of an update, we may call it opaque. In order to model the uncertainty an agent has about the result of an update, the same update must behave differently across different possible worlds. In this paper, I study opaque updates using a simple system of dynamic epistemic logic suitably modified for that purpose. The paper highlights the connection between opaque updates and the dynamicepistemic principles PerfectRecall and NoMiracles. I argue that opaque updates are central to contemporary discussions in epistemology, in particular to externalist theories of knowledge and to the related problem of epistemic bootstrapping, or easy knowledge. Opaque updates allow us to explicitly investigate a dynamic (or diachronic) form of uncertainty, using simple and precise logical tools. Word Count:
Rank  Word  Count 
0  update  5 
Excerpts:
...uncertainty as to the behavior of the update and we may call it a transparent ...
...and we may call it a transparent update if an agent is uncertain about the ...
...is uncertain about the behavior of an update we may call it opaque in order ...
...agent has about the result of an update the same update must behave differently across ...
...the result of an update the same update must behave differently across different possible worlds ...

1  opaque  5 
Excerpts:
...of an update we may call it opaque in order to model the uncertainty an ...
...possible worlds in this paper i study opaque updates using a simple system of dynamic ...
...purpose the paper highlights the connection between opaque updates and the dynamicepistemic principles perfectrecall and ...
...principles perfectrecall and nomiracles i argue that opaque updates are central to contemporary discussions in ...
...problem of epistemic bootstrapping or easy knowledge opaque updates allow us to explicitly investigate a ...

2  updates  4 
Excerpts:
...worlds in this paper i study opaque updates using a simple system of dynamic epistemic ...
...the paper highlights the connection between opaque updates and the dynamicepistemic principles perfectrecall and nomiracles ...
...perfectrecall and nomiracles i argue that opaque updates are central to contemporary discussions in epistemology ...
...of epistemic bootstrapping or easy knowledge opaque updates allow us to explicitly investigate a dynamic ...

3  uncertainty  3 
Excerpts:
...possible worlds then the agent has no uncertainty as to the behavior of the update ...
...it opaque in order to model the uncertainty an agent has about the result of ...
...investigate a dynamic or diachronic form of uncertainty using simple and precise logical tools ...

4  agent  3 
Excerpts:
...across all epistemically possible worlds then the agent has no uncertainty as to the behavior ...
...call it a transparent update if an agent is uncertain about the behavior of an ...
...in order to model the uncertainty an agent has about the result of an update ...

5  simple  2 
Excerpts:
...paper i study opaque updates using a simple system of dynamic epistemic logic suitably modified ...
...dynamic or diachronic form of uncertainty using simple and precise logical tools ...

6  knowledge  2 
Excerpts:
...epistemology in particular to externalist theories of knowledge and to the related problem of epistemic ...
...related problem of epistemic bootstrapping or easy knowledge opaque updates allow us to explicitly investigate ...

7  dynamic  2 
Excerpts:
...opaque updates using a simple system of dynamic epistemic logic suitably modified for that purpose ...
...updates allow us to explicitly investigate a dynamic or diachronic form of uncertainty using simple ...

8  call  2 
Excerpts:
...behavior of the update and we may call it a transparent update if an agent ...
...the behavior of an update we may call it opaque in order to model the ...

9  may  2 
Excerpts:
...the behavior of the update and we may call it a transparent update if an ...
...about the behavior of an update we may call it opaque in order to model ...

A Family of Strict/Tolerant Logics
 Author: Error: Author not contained in standard '<author>' tag in feed
 Publication date: 20200907
Abstract:
Strict/tolerant logic, ST, evaluates the premises and the consequences of its consequence relation differently, with the premises held to stricter standards while consequences are treated more tolerantly. More specifically, ST is a threevalued logic with left sides of sequents understood as if in Kleene's Strong Three Valued Logic, and right sides as if in Priest's Logic of Paradox. Surprisingly, this hybrid validates the same sequents that classical logic does. A version of this result has been extended to meta, metameta, ¦ consequence levels in Barrio et al. (2019). In my earlier paper Fitting (2019) I showed that the original ideas behind ST are, in fact, much more general than first appeared, and an infinite family of many valued logics have Strict/Tolerant counterparts. This family includes both Kleene's and Priest's logic individually, as well as first degree entailment. For instance, for both the Kleene and the Priest logic, the corresponding strict/tolerant logic is sixvalued, but with differing sets of strictly and tolerantly designated truth values. The present paper extends that generalization in two directions. We examine a reverse notion, of Tolerant/Strict logics, which exist for the same structures that were investigated in Fitting (2019). And we show that the generalization extends through the meta, metameta, ¦ consequence levels for the same infinite family of many valued logics. Finally we close with remarks on the status of cut and related rules, which can actually be rather nuanced. Throughout, the aim is not the philosophical applications of the Strict/Tolerant idea, but the determination of how general a phenomenon it is. Word Count:
Inferences and Metainferences in ST
 Author: Error: Author not contained in standard '<author>' tag in feed
 Publication date: 20200903
Abstract:
In a recent paper, Barrio, Tajer and Rosenblatt establish a correspondence between metainferences holding in the stricttolerant logic of transparent truth ST+ and inferences holding in the logic of paradox LP+. They argue that LP+ is ST+'s external logic and they question whether ST+'s solution to the semantic paradoxes is fundamentally different from LP+'s. Here we establish that by parity of reasoning, ST+ can be related to LP+'s dual logic K3+. We clarify the distinction between internal and external logic and argue that while ST+'s nonclassicality can be granted, its selfdual character does not tie it to LP+ more closely than to K3+. Word Count:
Rank  Word  Count 
0  logic  5 
Excerpts:
...correspondence between metainferences holding in the stricttolerant logic of transparent truth st+ and inferences holding ...
...truth st+ and inferences holding in the logic of paradox lp+ they argue that lp+ ...
...they argue that lp+ is st+s external logic and they question whether st+s solution to ...
...st+ can be related to lp+s dual logic k3+ we clarify the distinction between internal ...
...clarify the distinction between internal and external logic and argue that while st+s nonclassicality can ...

1  lp+  3 
Excerpts:

2  st+s  3 
Excerpts:

3  st+  2 
Excerpts:

4  establish  2 
Excerpts:
...a recent paper barrio tajer and rosenblatt establish a correspondence between metainferences holding in the ...
...is fundamentally different from lp+s here we establish that by parity of reasoning st+ can ...

5  holding  2 
Excerpts:
...and rosenblatt establish a correspondence between metainferences holding in the stricttolerant logic of transparent truth ...
...logic of transparent truth st+ and inferences holding in the logic of paradox lp+ they ...

6  k3+  2 
Excerpts:

7  external  2 
Excerpts:
...lp+ they argue that lp+ is st+s external logic and they question whether st+s solution ...
...we clarify the distinction between internal and external logic and argue that while st+s nonclassicality ...

8  lp+s  2 
Excerpts:

9  parity  1 
Excerpts:
...from lp+s here we establish that by parity of reasoning st+ can be related to ...

De Finettian Logics of Indicative Conditionals Part I: Trivalent Semantics and Validity
 Author: Error: Author not contained in standard '<author>' tag in feed
 Publication date: 20200820
Abstract:
This paper explores trivalent truth conditions for indicative conditionals, examining the defective' truth table proposed by de Finetti (1936) and Reichenbach (1935, 1944). On their approach, a conditional takes the value of its consequent whenever its antecedent is true, and the value Indeterminate otherwise. Here we deal with the problem of selecting an adequate notion of validity for this conditional. We show that all standard validity schemes based on de Finetti's table come with some problems, and highlight two ways out of the predicament: one pairs de Finetti's conditional (DF) with validity as the preservation of nonfalse values (TTvalidity), but at the expense of Modus Ponens; the other modifies de Finetti's table to restore Modus Ponens. In Part I of this paper, we present both alternatives, with specific attention to a variant of de Finetti's table (CC) proposed by Cooper (Inquiry 11, 295“320, 1968) and Cantwell (Notre Dame Journal of Formal Logic 49, 245“260, 2008). In Part II, we give an indepth treatment of the proof theory of the resulting logics, DF/TT and CC/TT: both are connexive logics, but with significantly different algebraic properties. Word Count:
Convergence to the Truth Without Countable Additivity
 Author: Error: Author not contained in standard '<author>' tag in feed
 Publication date: 20200820
Abstract:
Must probabilities be countably additive? On the one hand, arguably, requiring countable additivity is too restrictive. As de Finetti pointed out, there are situations in which it is reasonable to use merely finitely additive probabilities. On the other hand, countable additivity is fruitful. It can be used to prove deep mathematical theorems that do not follow from finite additivity alone. One of the most philosophically important examples of such a result is the Bayesian convergence to the truth theorem, which says that conditional probabilities converge to 1 for true hypotheses and to 0 for false hypotheses. In view of the longstanding debate about countable additivity, it is natural to ask in what circumstances finitely additive theories deliver the same results as the countably additive theory. This paper addresses that question and initiates a systematic study of convergence to the truth in a finitely additive setting. There is also some discussion of how the formal results can be applied to ongoing debates in epistemology and the philosophy of science. Word Count:
Rank  Word  Count 
0  additive  5 
Excerpts:
... must probabilities be countably additive on the one hand arguably requiring countable ...
...it is reasonable to use merely finitely additive probabilities on the other hand countable additivity ...
...natural to ask in what circumstances finitely additive theories deliver the same results as the ...
...deliver the same results as the countably additive theory this paper addresses that question and ...
...convergence to the truth in a finitely additive setting there is also some discussion of ...

1  additivity  4 
Excerpts:
...on the one hand arguably requiring countable additivity is too restrictive as de finetti pointed ...
...additive probabilities on the other hand countable additivity is fruitful it can be used to ...
...theorems that do not follow from finite additivity alone one of the most philosophically important ...
...view of the longstanding debate about countable additivity it is natural to ask in what ...

2  finitely  3 
Excerpts:
...which it is reasonable to use merely finitely additive probabilities on the other hand countable ...
...is natural to ask in what circumstances finitely additive theories deliver the same results as ...
...of convergence to the truth in a finitely additive setting there is also some discussion ...

3  probabilities  3 
Excerpts:
... must probabilities be countably additive on the one hand ...
...is reasonable to use merely finitely additive probabilities on the other hand countable additivity is ...
...the truth theorem which says that conditional probabilities converge to 1 for true hypotheses and ...

4  countable  3 
Excerpts:
...additive on the one hand arguably requiring countable additivity is too restrictive as de finetti ...
...finitely additive probabilities on the other hand countable additivity is fruitful it can be used ...
...in view of the longstanding debate about countable additivity it is natural to ask in ...

5  convergence  2 
Excerpts:
...of such a result is the bayesian convergence to the truth theorem which says that ...
...question and initiates a systematic study of convergence to the truth in a finitely additive ...

6  hypotheses  2 
Excerpts:
...conditional probabilities converge to 1 for true hypotheses and to 0 for false hypotheses in ...
...true hypotheses and to 0 for false hypotheses in view of the longstanding debate about ...

7  results  2 
Excerpts:
...circumstances finitely additive theories deliver the same results as the countably additive theory this paper ...
...also some discussion of how the formal results can be applied to ongoing debates in ...

8  truth  2 
Excerpts:
...result is the bayesian convergence to the truth theorem which says that conditional probabilities converge ...
...a systematic study of convergence to the truth in a finitely additive setting there is ...

9  countably  2 
Excerpts:
... must probabilities be countably additive on the one hand arguably requiring ...
...theories deliver the same results as the countably additive theory this paper addresses that question ...

Unwinding Modal Paradoxes on Digraphs
 Author: Error: Author not contained in standard '<author>' tag in feed
 Publication date: 20200818
Abstract:
The unwinding that Cook (J. Symbol. Log. 69(3), 767“774 2004) proposed is a simple but powerful method of generating new paradoxes from known ones. This paper extends Cook's unwinding to a larger class of paradoxes and studies further the basic properties of the unwinding. The unwinding we study is a procedure, by which when inputting a Boolean modal net together with a definable digraph, we get a set of sentences in which we have a ˜counterpart' for each sentence of the Boolean modal net and each point of the digraph. What is more, whenever a sentence of the Boolean modal net says another sentence is necessary, then the counterpart of the first sentence at a point correspondingly says the counterparts of the second one at all accessible points of that point are all true. The output of the procedure is called ˜the unwinding of a Boolean modal net on a definable digraph'. We prove that the unwinding procedure preserves paradoxicality: a Boolean modal net is paradoxical on a definable digraph, iff the unwinding of it on this digraph is also paradoxical. Besides, the dependence digraph for the unwinding of a Boolean modal net on a definable digraph is proved to be isomorphic to the unwinding of the dependence digraph for the Boolean modal net on the previous definable digraph. So the unwinding of a Boolean modal net on a digraph is selfreferential, iff the Boolean modal net is selfreferential and the digraph is cyclic. Thus, on the one hand, the unwinding of any Boolean modal net on an acyclic digraph is nonselfreferential. In particular, the unwinding of any Boolean modal net on
\(\langle {\mathbb N}, <\rangle \)
is nonselfreferential. On the other hand, if a Boolean modal net is paradoxical on a locally finite digraph, the unwinding of it on that digraph must be selfreferential. Hence, starting from a Boolean modal paradox, the unwinding can output a nonselfreferential paradox only if the digraph is not locally finite. Word Count:
A More Unified Approach to Free Logics
 Author: Error: Author not contained in standard '<author>' tag in feed
 Publication date: 20200817
Abstract:
Free logics is a family of firstorder logics which came about as a result of examining the existence assumptions of classical logic. What those assumptions are varies, but the central ones are that (i) the domain of interpretation is not empty, (ii) every name denotes exactly one object in the domain and (iii) the quantifiers have existential import. Free logics usually reject the claim that names need to denote in (ii), and of the systems considered in this paper, the positive free logic concedes that some atomic formulas containing nondenoting names (namely selfidentity) are true, while negative free logic rejects even the latter claim. Inclusive logics, which reject (i), are likewise considered. These logics have complex and varied axiomatizations and semantics, and the goal of this paper is to present an orderly examination of the various systems and their mutual relations. This is done by first offering a formalization, using sequent calculi which possess all the desired structural properties of a good proof system, including admissibility of contraction and cut, while streamlining free logics in a way no other approach has. We then present a simple and unified system of abstract semantics, which allows for a straightforward demonstration of the metatheoretical properties, and offers insights into the relationship between different logics (free and classical). The final part of this paper is dedicated to extending the system with modalities by using a labeled sequent calculus, and here we are again able to map out the different approaches and their mutual relations using the same framework. Word Count:
Rank  Word  Count 
0  logics  7 
Excerpts:
... free logics is a family of firstorder logics which ...
...free logics is a family of firstorder logics which came about as a result of ...
...iii the quantifiers have existential import free logics usually reject the claim that names need ...
...logic rejects even the latter claim inclusive logics which reject i are likewise considered these ...
...which reject i are likewise considered these logics have complex and varied axiomatizations and semantics ...
...of contraction and cut while streamlining free logics in a way no other approach has ...
...offers insights into the relationship between different logics free and classical the final part of ...

1  free  6 
Excerpts:
... free logics is a family of firstorder logics ...
...and iii the quantifiers have existential import free logics usually reject the claim that names ...
...systems considered in this paper the positive free logic concedes that some atomic formulas containing ...
...names namely selfidentity are true while negative free logic rejects even the latter claim inclusive ...
...admissibility of contraction and cut while streamlining free logics in a way no other approach ...
...insights into the relationship between different logics free and classical the final part of this ...

2  logic  3 
Excerpts:
...of examining the existence assumptions of classical logic what those assumptions are varies but the ...
...considered in this paper the positive free logic concedes that some atomic formulas containing nondenoting ...
...namely selfidentity are true while negative free logic rejects even the latter claim inclusive logics ...

3  system  3 
Excerpts:
...desired structural properties of a good proof system including admissibility of contraction and cut while ...
...we then present a simple and unified system of abstract semantics which allows for a ...
...this paper is dedicated to extending the system with modalities by using a labeled sequent ...

4  using  3 
Excerpts:
...is done by first offering a formalization using sequent calculi which possess all the desired ...
...to extending the system with modalities by using a labeled sequent calculus and here we ...
...the different approaches and their mutual relations using the same framework ...

5  names  2 
Excerpts:
...free logics usually reject the claim that names need to denote in ii and of ...
...concedes that some atomic formulas containing nondenoting names namely selfidentity are true while negative free ...

6  systems  2 
Excerpts:
...to denote in ii and of the systems considered in this paper the positive free ...
...present an orderly examination of the various systems and their mutual relations this is done ...

7  considered  2 
Excerpts:
...denote in ii and of the systems considered in this paper the positive free logic ...
...inclusive logics which reject i are likewise considered these logics have complex and varied axiomatizations ...

8  while  2 
Excerpts:
...containing nondenoting names namely selfidentity are true while negative free logic rejects even the latter ...
...system including admissibility of contraction and cut while streamlining free logics in a way no ...

9  semantics  2 
Excerpts:
...logics have complex and varied axiomatizations and semantics and the goal of this paper is ...
...a simple and unified system of abstract semantics which allows for a straightforward demonstration of ...

Logical Predictivism
 Author: Error: Author not contained in standard '<author>' tag in feed
 Publication date: 20200813
Abstract:
Motivated by weaknesses with traditional accounts of logical epistemology, considerable attention has been paid recently to the view, known as antiexceptionalism about logic (AEL), that the subject matter and epistemology of logic may not be so different from that of the recognised sciences. One of the most prevalent claims made by advocates of AEL is that theory choice within logic is significantly similar to that within the sciences. This connection with scientific methodology highlights a considerable challenge for the antiexceptionalist, as two uncontentious claims about scientific theories are that they attempt to explain a target phenomenon and (at least partially) prove their worth through successful predictions. Thus, if this methodological AEL is to be viable, the antiexceptionalist will need a reasonable account of what phenomena logics are attempting to explain, how they can explain, and in what sense they can be said to issue predictions. This paper makes sense of the antiexceptionalist proposal with a new account of logical theory choice, logical predictivism, according to which logics are engaged in both a process of prediction and explanation. Word Count:
Rank  Word  Count 
0  logic  3 
Excerpts:
...to the view known as antiexceptionalism about logic ael that the subject matter and epistemology ...
...that the subject matter and epistemology of logic may not be so different from that ...
...of ael is that theory choice within logic is significantly similar to that within the ...

1  explain  3 
Excerpts:
...scientific theories are that they attempt to explain a target phenomenon and at least partially ...
...of what phenomena logics are attempting to explain how they can explain and in what ...
...are attempting to explain how they can explain and in what sense they can be ...

2  logical  3 
Excerpts:
...motivated by weaknesses with traditional accounts of logical epistemology considerable attention has been paid recently ...
...antiexceptionalist proposal with a new account of logical theory choice logical predictivism according to which ...
...a new account of logical theory choice logical predictivism according to which logics are engaged ...

3  ael  3 
Excerpts:
...the view known as antiexceptionalism about logic ael that the subject matter and epistemology of ...
...most prevalent claims made by advocates of ael is that theory choice within logic is ...
...through successful predictions thus if this methodological ael is to be viable the antiexceptionalist will ...

4  antiexceptionalist  3 
Excerpts:
...methodology highlights a considerable challenge for the antiexceptionalist as two uncontentious claims about scientific theories ...
...methodological ael is to be viable the antiexceptionalist will need a reasonable account of what ...
...predictions this paper makes sense of the antiexceptionalist proposal with a new account of logical ...

5  logics  2 
Excerpts:
...need a reasonable account of what phenomena logics are attempting to explain how they can ...
...theory choice logical predictivism according to which logics are engaged in both a process of ...

6  within  2 
Excerpts:
...advocates of ael is that theory choice within logic is significantly similar to that within ...
...within logic is significantly similar to that within the sciences this connection with scientific methodology ...

7  claims  2 
Excerpts:
...recognised sciences one of the most prevalent claims made by advocates of ael is that ...
...challenge for the antiexceptionalist as two uncontentious claims about scientific theories are that they attempt ...

8  sciences  2 
Excerpts:
...so different from that of the recognised sciences one of the most prevalent claims made ...
...is significantly similar to that within the sciences this connection with scientific methodology highlights a ...

9  sense  2 
Excerpts:
...how they can explain and in what sense they can be said to issue predictions ...
...said to issue predictions this paper makes sense of the antiexceptionalist proposal with a new ...

Correction to: KripkeCompleteness and Cutelimination Theorems for Intuitionistic Paradefinite Logics With and Without QuasiExplosion
 Author: Error: Author not contained in standard '<author>' tag in feed
 Publication date: 20200804
Abstract:
The original version of this article unfortunately contains several errors introduced by the typesetter during the publishing process. It has been corrected. Word Count:
Rank  Word  Count 
0  original  1 
Excerpts:
... the original version of this article unfortunately contains several ...

1  version  1 
Excerpts:
... the original version of this article unfortunately contains several errors ...

2  article  1 
Excerpts:
... the original version of this article unfortunately contains several errors introduced by the ...

3  unfortunately  1 
Excerpts:
... the original version of this article unfortunately contains several errors introduced by the typesetter ...

4  contains  1 
Excerpts:
...the original version of this article unfortunately contains several errors introduced by the typesetter during ...

5  several  1 
Excerpts:
...original version of this article unfortunately contains several errors introduced by the typesetter during the ...

6  errors  1 
Excerpts:
...version of this article unfortunately contains several errors introduced by the typesetter during the publishing ...

7  introduced  1 
Excerpts:
...of this article unfortunately contains several errors introduced by the typesetter during the publishing process ...

8  typesetter  1 
Excerpts:
...unfortunately contains several errors introduced by the typesetter during the publishing process it has been ...

9  during  1 
Excerpts:
...contains several errors introduced by the typesetter during the publishing process it has been corrected ...

Relative Necessity and Propositional Quantification
 Author: Error: Author not contained in standard '<author>' tag in feed
 Publication date: 20200801
Abstract:
Following Smiley's (The Journal of Symbolic Logic, 28, 113“134 1963) influential proposal, it has become standard practice to characterise notions of relative necessity in terms of simple strict conditionals. However, Humberstone (Reports on Mathematical Logic, 13, 33“42 1981) and others have highlighted various flaws with Smiley's now standard account of relative necessity. In their recent article, Hale and Leech (Journal of Philosophical Logic, 46, 1“26 2017) propose a novel account of relative necessity designed to overcome the problems facing the standard account. Nevertheless, the current article argues that Hale & Leech's account suffers from its own defects, some of which Hale & Leech are aware of but underplay. To supplement this criticism, the article offers an alternative account of relative necessity which overcomes these defects. This alternative account is developed in a quantified modal propositional logic and is shown modeltheoretically to meet several desiderata of an account of relative necessity. Word Count:
Logics of Synonymy
 Author: Error: Author not contained in standard '<author>' tag in feed
 Publication date: 20200801
Abstract:
We investigate synonymy in the strong sense of content identity (and not just meaning similarity). This notion is central in the philosophy of language and in applications of logic. We motivate, uniformly axiomatize, and characterize several benchmark' notions of synonymy in the messy class of all possible notions of synonymy. This class is divided by two intuitive principles that are governed by a nogo result. We use the notion of a scenario to get a logic of synonymy (SF) which is the canonical representative of one division. In the other division, the socalled conceptivist logics, we find, e.g., the wellknown system of analytic containment (AC). We axiomatize four logics of synonymy extending AC, relate them semantically and prooftheoretically to SF, and characterize them in terms of weak/strong subject matter preservation and weak/strong logical equivalence. This yields ways out of the nogo result and novel arguments'independent of a particular semantic framework'for each notion of synonymy discussed (using, e.g., Hurford disjunctions or homotopy theory). This points to pluralism about meaning and a certain noncompositionality of truth in logic programs and neural networks. And it unveils an impossibility for synonymy: if it is to preserve subject matter, then either conjunction and disjunction lose an essential property or a very weak absorption law is violated. Word Count:
Rank  Word  Count 
0  synonymy  7 
Excerpts:
... we investigate synonymy in the strong sense of content identity ...
...axiomatize and characterize several benchmark notions of synonymy in the messy class of all possible ...
...messy class of all possible notions of synonymy this class is divided by two intuitive ...
...a scenario to get a logic of synonymy sf which is the canonical representative of ...
...containment ac we axiomatize four logics of synonymy extending ac relate them semantically and prooftheoretically ...
...a particular semantic frameworkfor each notion of synonymy discussed using eg hurford disjunctions or homotopy ...
...networks and it unveils an impossibility for synonymy if it is to preserve subject matter ...

1  logic  3 
Excerpts:
...philosophy of language and in applications of logic we motivate uniformly axiomatize and characterize several ...
...notion of a scenario to get a logic of synonymy sf which is the canonical ...
...and a certain noncompositionality of truth in logic programs and neural networks and it unveils ...

2  notion  3 
Excerpts:
...identity and not just meaning similarity this notion is central in the philosophy of language ...
...by a nogo result we use the notion of a scenario to get a logic ...
...argumentsindependent of a particular semantic frameworkfor each notion of synonymy discussed using eg hurford disjunctions ...

3  weakstrong  2 
Excerpts:
...sf and characterize them in terms of weakstrong subject matter preservation and weakstrong logical equivalence ...
...terms of weakstrong subject matter preservation and weakstrong logical equivalence this yields ways out of ...

4  eg  2 
Excerpts:
...division the socalled conceptivist logics we find eg the wellknown system of analytic containment ac ...
...frameworkfor each notion of synonymy discussed using eg hurford disjunctions or homotopy theory this points ...

5  characterize  2 
Excerpts:
...of logic we motivate uniformly axiomatize and characterize several benchmark notions of synonymy in the ...
...them semantically and prooftheoretically to sf and characterize them in terms of weakstrong subject matter ...

6  axiomatize  2 
Excerpts:
...in applications of logic we motivate uniformly axiomatize and characterize several benchmark notions of synonymy ...
...wellknown system of analytic containment ac we axiomatize four logics of synonymy extending ac relate ...

7  sf  2 
Excerpts:
...scenario to get a logic of synonymy sf which is the canonical representative of one ...
...ac relate them semantically and prooftheoretically to sf and characterize them in terms of weakstrong ...

8  division  2 
Excerpts:
...which is the canonical representative of one division in the other division the socalled conceptivist ...
...representative of one division in the other division the socalled conceptivist logics we find eg ...

9  logics  2 
Excerpts:
...in the other division the socalled conceptivist logics we find eg the wellknown system of ...
...of analytic containment ac we axiomatize four logics of synonymy extending ac relate them semantically ...

Forcing and the Universe of Sets: Must We Lose Insight?
 Author: Error: Author not contained in standard '<author>' tag in feed
 Publication date: 20200801
Abstract:
A central area of current philosophical debate in the foundations of mathematics concerns whether or not there is a single, maximal, universe of set theory. Universists maintain that there is such a universe, while Multiversists argue that there are many universes, no one of which is ontologically privileged. Often forcing constructions that add subsets to models are cited as evidence in favour of the latter. This paper informs this debate by analysing ways the Universist might interpret this discourse that seems to necessitate the addition of subsets to V. We argue that despite the prima facie incoherence of such talk for the Universist, she nonetheless has reason to try and provide interpretation of this discourse. We analyse extant interpretations of such talk, and analyse various tradeoffs in naturality that might be made. We conclude that the Universist has promising options for interpreting different forcing constructions. Word Count:
Rank  Word  Count 
0  universist  3 
Excerpts:
...informs this debate by analysing ways the universist might interpret this discourse that seems to ...
...facie incoherence of such talk for the universist she nonetheless has reason to try and ...
...might be made we conclude that the universist has promising options for interpreting different forcing ...

1  might  2 
Excerpts:
...this debate by analysing ways the universist might interpret this discourse that seems to necessitate ...
...and analyse various tradeoffs in naturality that might be made we conclude that the universist ...

2  universe  2 
Excerpts:
...or not there is a single maximal universe of set theory universists maintain that there ...
...universists maintain that there is such a universe while multiversists argue that there are many ...

3  discourse  2 
Excerpts:
...analysing ways the universist might interpret this discourse that seems to necessitate the addition of ...
...to try and provide interpretation of this discourse we analyse extant interpretations of such talk ...

4  debate  2 
Excerpts:
... a central area of current philosophical debate in the foundations of mathematics concerns whether ...
...of the latter this paper informs this debate by analysing ways the universist might interpret ...

5  forcing  2 
Excerpts:
...one of which is ontologically privileged often forcing constructions that add subsets to models are ...
...universist has promising options for interpreting different forcing constructions ...

6  analyse  2 
Excerpts:
...and provide interpretation of this discourse we analyse extant interpretations of such talk and analyse ...
...analyse extant interpretations of such talk and analyse various tradeoffs in naturality that might be ...

7  constructions  2 
Excerpts:
...of which is ontologically privileged often forcing constructions that add subsets to models are cited ...
...has promising options for interpreting different forcing constructions ...

8  talk  2 
Excerpts:
...despite the prima facie incoherence of such talk for the universist she nonetheless has reason ...
...discourse we analyse extant interpretations of such talk and analyse various tradeoffs in naturality that ...

9  subsets  2 
Excerpts:
...ontologically privileged often forcing constructions that add subsets to models are cited as evidence in ...
...that seems to necessitate the addition of subsets to v we argue that despite the ...

Intuitionistic Conditional Logics
 Author: Error: Author not contained in standard '<author>' tag in feed
 Publication date: 20200801
Abstract:
Building on recent work by Yale Weiss, we study conditional logics in the intuitionistic setting. We consider a number of semantic conditions which give rise, among others, to intuitionistic counterparts of Lewis's logic VC and Stalnaker's C2. We show how to obtain a sound and complete axiomatization of each logic arising from a combination of these conditions. On the way, we remark how, in the intuitionistic setting, certain classically equivalent principles of conditional logic come apart, and how certain logical connections between different principles no longer hold. Word Count:
Rank  Word  Count 
0  intuitionistic  3 
Excerpts:
...weiss we study conditional logics in the intuitionistic setting we consider a number of semantic ...
...conditions which give rise among others to intuitionistic counterparts of lewiss logic vc and stalnakers ...
...the way we remark how in the intuitionistic setting certain classically equivalent principles of conditional ...

1  logic  3 
Excerpts:
...among others to intuitionistic counterparts of lewiss logic vc and stalnakers c2 we show how ...
...a sound and complete axiomatization of each logic arising from a combination of these conditions ...
...setting certain classically equivalent principles of conditional logic come apart and how certain logical connections ...

2  certain  2 
Excerpts:
...we remark how in the intuitionistic setting certain classically equivalent principles of conditional logic come ...
...of conditional logic come apart and how certain logical connections between different principles no longer ...

3  conditional  2 
Excerpts:
...recent work by yale weiss we study conditional logics in the intuitionistic setting we consider ...
...intuitionistic setting certain classically equivalent principles of conditional logic come apart and how certain logical ...

4  setting  2 
Excerpts:
...we study conditional logics in the intuitionistic setting we consider a number of semantic conditions ...
...way we remark how in the intuitionistic setting certain classically equivalent principles of conditional logic ...

5  principles  2 
Excerpts:
...in the intuitionistic setting certain classically equivalent principles of conditional logic come apart and how ...
...and how certain logical connections between different principles no longer hold ...

6  conditions  2 
Excerpts:
...setting we consider a number of semantic conditions which give rise among others to intuitionistic ...
...logic arising from a combination of these conditions on the way we remark how in ...

7  building  1 
Excerpts:
... building on recent work by yale weiss we ...

8  axiomatization  1 
Excerpts:
...how to obtain a sound and complete axiomatization of each logic arising from a combination ...

9  each  1 
Excerpts:
...obtain a sound and complete axiomatization of each logic arising from a combination of these ...

