Review of Symbolic Logic最新文献

{"title":"Ontological Purity for Formal Proofs","authors":"Robin Martinot","doi":"10.1017/s1755020323000333","DOIUrl":"https://doi.org/10.1017/s1755020323000333","url":null,"abstract":"An abstract is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.","PeriodicalId":49628,"journal":{"name":"Review of Symbolic Logic","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136347337","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Non-Factive Kolmogorov Conditionalization","authors":"Michael Rescorla","doi":"10.1017/s1755020323000345","DOIUrl":"https://doi.org/10.1017/s1755020323000345","url":null,"abstract":"","PeriodicalId":49628,"journal":{"name":"Review of Symbolic Logic","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135870012","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"An algebraic proof of completeness for monadic fuzzy predicate logic mMTL","authors":"Jun Tao Wang, Hongwei Wu","doi":"10.1017/s1755020323000291","DOIUrl":"https://doi.org/10.1017/s1755020323000291","url":null,"abstract":"An abstract is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.","PeriodicalId":49628,"journal":{"name":"Review of Symbolic Logic","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135884415","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Decidable fragments of the Quantified argument calculus","authors":"Edi Pavlović, Norbert Gratzl","doi":"10.1017/s175502032300031x","DOIUrl":"https://doi.org/10.1017/s175502032300031x","url":null,"abstract":"An abstract is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.","PeriodicalId":49628,"journal":{"name":"Review of Symbolic Logic","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-09-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135200091","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"ALGEBRAIC SEMANTICS FOR RELATIVE TRUTH, AWARENESS, AND POSSIBILITY","authors":"Evan Piermont","doi":"10.1017/s1755020323000308","DOIUrl":"https://doi.org/10.1017/s1755020323000308","url":null,"abstract":"Abstract This paper puts forth a class of algebraic structures, relativized Boolean algebras (RBAs), that provide semantics for propositional logic in which truth/validity is only defined relative to a local domain. In particular, the join of an event and its complement need not be the top element. Nonetheless, behavior is locally governed by the laws of propositional logic. By further endowing these structures with operators—akin to the theory of modal Algebras—RBAs serve as models of modal logics in which truth is relative. In particular, modal RBAs provide semantics for various well-known awareness logics and an alternative view of possibility semantics.","PeriodicalId":49628,"journal":{"name":"Review of Symbolic Logic","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135343280","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"CANONICITY IN POWER AND MODAL LOGICS OF FINITE ACHRONAL WIDTH","authors":"ROBERT GOLDBLATT, IAN HODKINSON","doi":"10.1017/s1755020323000060","DOIUrl":"https://doi.org/10.1017/s1755020323000060","url":null,"abstract":"Abstract We develop a method for showing that various modal logics that are valid in their countably generated canonical Kripke frames must also be valid in their uncountably generated ones. This is applied to many systems, including the logics of finite width, and a broader class of multimodal logics of ‘finite achronal width’ that are introduced here.","PeriodicalId":49628,"journal":{"name":"Review of Symbolic Logic","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136195778","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Dynamic Hyperintensional Belief Revision - erratum","authors":"Aybüke Özgün, Francesco Berto","doi":"10.1017/s1755020321000381","DOIUrl":"https://doi.org/10.1017/s1755020321000381","url":null,"abstract":"","PeriodicalId":49628,"journal":{"name":"Review of Symbolic Logic","volume":null,"pages":null},"PeriodicalIF":0.6,"publicationDate":"2021-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78172192","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"INDEPENDENCE PROOFS IN NON-CLASSICAL SET THEORIES","authors":"Sourav Tarafder, G. Venturi","doi":"10.1017/S1755020321000095","DOIUrl":"https://doi.org/10.1017/S1755020321000095","url":null,"abstract":"\u0000 In this paper we extend to non-classical set theories the standard strategy of proving independence using Boolean-valued models. This extension is provided by means of a new technique that, combining algebras (by taking their product), is able to provide product-algebra-valued models of set theories. In this paper we also provide applications of this new technique by showing that: (1) we can import the classical independence results to non-classical set theory (as an example we prove the independence of \u0000 \u0000 \u0000 \u0000$mathsf {CH}$\u0000\u0000 \u0000 ); and (2) we can provide new independence results. We end by discussing the role of non-classical algebra-valued models for the debate between universists and multiversists and by arguing that non-classical models should be included as legitimate members of the multiverse.","PeriodicalId":49628,"journal":{"name":"Review of Symbolic Logic","volume":null,"pages":null},"PeriodicalIF":0.6,"publicationDate":"2021-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86586985","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Formal Qualitative Probability","authors":"Daniel Kian Mc Kiernan","doi":"10.1017/s1755020319000480","DOIUrl":"https://doi.org/10.1017/s1755020319000480","url":null,"abstract":"\u0000 Choices rarely deal with certainties; and, where assertoric logic and modal logic are insufficient, those seeking to be reasonable turn to one or more things called “probability.” These things typically have a shared mathematical form, which is an arithmetic construct. The construct is often felt to be unsatisfactory for various reasons. A more general construct is that of a preordering, which may even be incomplete, allowing for cases in which there is no known probability relation between two propositions or between two events. Previous discussion of incomplete preorderings has been as if incidental, with researchers focusing upon preorderings for which quantifications are possible. This article presents formal axioms for the more general case. Challenges peculiar to some specific interpretations of the nature of probability are brought to light in the context of these propositions. A qualitative interpretation is offered for probability differences that are often taken to be quantified. A generalization of Bayesian updating is defended without dependence upon coherence. Qualitative hypothesis testing is offered as a possible alternative in cases for which quantitative hypothesis testing is shown to be unsuitable.\u0000","PeriodicalId":49628,"journal":{"name":"Review of Symbolic Logic","volume":null,"pages":null},"PeriodicalIF":0.6,"publicationDate":"2020-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90981729","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Obligation as Weakest Permission: a strongly Complete Axiomatization","authors":"F. Putte","doi":"10.1017/S1755020316000034","DOIUrl":"https://doi.org/10.1017/S1755020316000034","url":null,"abstract":"In (Anglberger et al., 2015, Section 4.1), a deontic logic is proposed which explicates the idea that a formula φ is obligatory if and only if it is (semantically speaking) the weakest permission. We give a sound and strongly complete, Hilbert style axiomatization for this logic. As a corollary, it is compact, contradicting earlier claims from Anglberger et al. (2015). In addition, we prove that our axiomatization is equivalent to Anglberger et al.’s infinitary proof system, and show that our results are robust w.r.t. certain changes in the underlying semantics. §1. Intro. In Roy et al. (2014, 2012) and Anglberger et al. (2015), a logic is developed for “obligation as weakest permission”.1 The semantics proposed in Anglberger et al. (2015) is meant to capture the deontic aspects of reasoning in strategic games, where we speak about properties of the best actions available to a given agent. Whereas usually in formal models of such games, actions and/or agents are modeled explicitly at the object level, the present logic only speaks about action tokens (which correspond to states in a Kripke-model) and action types (sets of action tokens). Let us explain this briefly—we refer to the cited works for a more elaborate discussion. Consider a situation in which an agent can choose from a number of distinct action tokens, where at least some of these are optimal. Whereas the agent is permitted to perform one of those optimal action tokens, his sole obligation (if there is one at all – mind this important caveat) is to perform one of the optimal action tokens. This means that the deontic operators O and P can be read as follows, where φ refers to an arbitrary action type: Oφ: “φ is the (only) action type that is obligatory”, or more elaborately: “an action token is optimal if and only if it is of type φ” Pφ: “if an action is of type φ, then it is optimal” Anglberger et al. moreover introduce an alethic modality , which they interpret as a universal modality. φ thus means that all available action tokens are of type φ. They then propose what they call a “minimal logic” 5HD for these three operators. However, as they argue, 5HD only captures one half of the notion of “obligation as weakest permission”. That is, if φ is obligatory, then the logic stipulates that φ is the weakest permitted action type. The converse does not hold: something can be the weakest permitted action type without being obligatory. Received: September 30, 2015. 1 In more recent work Dong and Roy (2015); Van De Putte (2015), the logic is compared to other constructions in deontic logic. c © Association for Symbolic Logic, 2016 370 doi:10.1017/S1755020316000034 OBLIGATION AS WEAKEST PERMISSION 371 In the fourth section of Anglberger et al. (2015), a brief discussion of this converse direction is given, and it is shown how this translates to the semantics of 5HD. Let us call the resulting logic 5HD∗; it will be defined in Section 2. It is argued in Anglberger et al. (2015) that 5HD∗ is no","PeriodicalId":49628,"journal":{"name":"Review of Symbolic Logic","volume":null,"pages":null},"PeriodicalIF":0.6,"publicationDate":"2016-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77085133","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}