当前期刊: Journal of Logic and Computation Go to current issue    加入关注   
显示样式:        排序: IF: - GO 导出
我的关注
我的收藏
您暂时未登录!
登录
  • Corrigendum to: Displaying updates in logic
    J. Log. Comput. (IF 0.803) Pub Date : 2020-08-04
    Guillaume Aucher

    AbstractIn this paper, we consider a generalization of the notion of orthomodularity for posets to the concept of the generalized orthomodularity property (GO-property) by considering the $LU$-operators. This seemingly mild generalization of orthomodular posets and its order theoretical analysis yield rather strong application to effect algebras and orthomodular structures. Also, for several classes

    更新日期:2020-08-04
  • Sublattices and Δ-blocks of orthomodular posets
    J. Log. Comput. (IF 0.803) Pub Date : 2020-07-28
    Ivan Chajda; Helmut Länger

    States of quantum systems correspond to vectors in a Hilbert space and observations to closed subspaces. Hence, this logic corresponds to the algebra of closed subspaces of a Hilbert space. This can be considered as a complete lattice with orthocomplementation, but it is not distributive. It satisfies a weaker condition, the so-called orthomodularity. Later on, it was recognized that joins in this

    更新日期:2020-07-28
  • On Scott’s semantics for many-valued logic
    J. Log. Comput. (IF 0.803) Pub Date : 2020-07-21
    Satoru Niki; Peter Schuster

    The semantics in ordered abelian groups Scott proposed for Łukasiewicz’s many-valued logic fails to be sound for one direction of one of the rules Scott gave for implication. We show this by a counterexample Urquhart has used to justify that in his own semantics, every formula has to have a least point at which it is valid. While this condition would make Scott’s semantics sound, it would cause a problem

    更新日期:2020-07-28
  • Convergence, continuity, recurrence and Turing completeness in dynamic epistemic logic
    J. Log. Comput. (IF 0.803) Pub Date : 2020-07-21
    Dominik Klein; Rasmus K Rendsvig

    The paper analyses dynamic epistemic logic from a topological perspective. The main contribution consists of a framework in which dynamic epistemic logic satisfies the requirements for being a topological dynamical system thus interfacing discrete dynamic logics with continuous mappings of dynamical systems. The setting is based on a notion of logical convergence, demonstratively equivalent with convergence

    更新日期:2020-07-22
  • Locally constant constructive functions and connectedness of intervals
    J. Log. Comput. (IF 0.803) Pub Date : 2020-07-20
    Viktor Chernov

    We prove that every locally constant constructive function on an interval is in fact a constant function. This answers a question formulated by Andrej Bauer [ 1]. As a related result, we show that an interval consisting of constructive real numbers is in fact connected but can be decomposed into the disjoint union of two sequentially closed nonempty sets.

    更新日期:2020-07-22
  • Ordered models for concept representation
    J. Log. Comput. (IF 0.803) Pub Date : 2020-07-20
    Michael Freund

    Basic notions linked with concept theory can be accounted for by partial order relations. These orders translate the fact that, for an agent, an object may be seen as a better or a more typical exemplar of a concept than anyother. They adequately model notions linked with categorial membership, typicality and resemblance, without any of the drawbacks that are classically encountered in conjunction

    更新日期:2020-07-20
  • The generalized orthomodularity property: configurations and pastings
    J. Log. Comput. (IF 0.803) Pub Date : 2020-06-23
    Ivan Chajda; Davide Fazio; Antonio Ledda

    In this paper, we consider a generalization of the notion of orthomodularity for posets to the concept of the generalized orthomodularity property (GO-property) by considering the |$LU$|-operators. This seemingly mild generalization of orthomodular posets and its order theoretical analysis yield rather strong application to effect algebras and orthomodular structures. Also, for several classes of orthoalgebras

    更新日期:2020-07-13
  • On the different types of collective attacks in abstract argumentation: equivalence results for SETAFs
    J. Log. Comput. (IF 0.803) Pub Date : 2020-06-22
    Wolfgang Dvořák; Anna Rapberger; Stefan Woltran

    Argumentation frameworks with collective attacks are a prominent extension of Dung’s abstract argumentation frameworks, where an attack can be drawn from a set of arguments to another argument. These frameworks are often abbreviated as SETAFs. Although SETAFs have received increasing interest recently, a thorough study on the actual behaviour of collective attacks has not been carried out yet. In particular

    更新日期:2020-07-13
  • Sette’s calculus P1 and some hierarchies of paraconsistent systems
    J. Log. Comput. (IF 0.803) Pub Date : 2020-06-02
    Janusz Ciuciura

    The necessary condition for a calculus to be paraconsistent is that its consequence relation is not explosive. This results in rejection of the principle of ex contradictione sequitur quodlibet. In 1973, Sette presented a calculus, denoted as |$P^1$|⁠, which is paraconsistent only at the atomic level, i.e. |$\alpha $| and |${\sim }\alpha $| yield any |$\beta $| if, and only if the formula |$\alpha

    更新日期:2020-07-13
  • Individual resource games and resource redistributions
    J. Log. Comput. (IF 0.803) Pub Date : 2020-05-28
    Nicolas Troquard

    To introduce agent-based technologies in real-world systems, one needs to acknowledge that the agents often have limited access to resources. They have to seek after resource objectives and compete for those resources. We introduce a class of resource games where resources and preferences are specified with the language of a resource-sensitive logic. The agents are endowed with a bag of resources and

    更新日期:2020-07-13
  • A study of possible-worlds semantics of relevance-sensitive belief revision
    J. Log. Comput. (IF 0.803) Pub Date : 2020-05-25
    Theofanis Aravanis; Pavlos Peppas; Mary-Anne Williams

    Parikh’s relevance-sensitive axiom (P) for belief revision is open to two different interpretations, i.e. the weak and the strong version of (P), both of which are plausible depending on the context. Given that strong (P) has not received the attention it deserves, in this article, an extended examination of it is conducted. In particular, we point out interesting properties of the semantic characterization

    更新日期:2020-07-13
  • Rational coordination with no communication or conventions
    J. Log. Comput. (IF 0.803) Pub Date : 2020-07-11
    Valentin Goranko; Antti Kuusisto; Raine Rönnholm

    We study pure coordination games where in every outcome, all players have identical payoffs, ‘win’ or ‘lose’. We identify and discuss a range of ‘purely rational principles’ guiding the reasoning of rational players in such games and compare the classes of coordination games that can be solved by such players with no preplay communication or conventions. We observe that it is highly nontrivial to delineate

    更新日期:2020-07-13
  • First-order swap structures semantics for some logics of formal inconsistency
    J. Log. Comput. (IF 0.803) Pub Date : 2020-06-04
    Marcelo E Coniglio; Aldo Figallo-Orellano; Ana C Golzio

    The logics of formal inconsistency (LFIs, for short) are paraconsistent logics (i.e. logics containing contradictory but non-trivial theories) having a consistency connective which allows to recover the ex falso quodlibet principle in a controlled way. The aim of this paper is considering a novel semantical approach to first-order LFIs based on Tarskian structures defined over swap structures, a special

    更新日期:2020-06-04
  • Space and time complexity for infinite time Turing machines
    J. Log. Comput. (IF 0.803) Pub Date : 2020-06-03
    Merlin Carl

    We consider notions of space by Winter [21, 22]. We answer several open questions about these notions, among them whether low space complexity implies low time complexity (it does not) and whether one of the equalities P=PSPACE, P|$_{+}=$|PSPACE|$_{+}$| and P|$_{++}=$|PSPACE|$_{++}$| holds for ITTMs (all three are false). We also show various separation results between space complexity classes for

    更新日期:2020-06-03
  • Self-full ceers and the uniform join operator
    J. Log. Comput. (IF 0.803) Pub Date : 2020-04-22
    Uri Andrews; Noah Schweber; Andrea Sorbi

    A computably enumerable equivalence relation (ceer) |$X$| is called self-full if whenever |$f$| is a reduction of |$X$| to |$X$|⁠, then the range of |$f$| intersects all |$X$|-equivalence classes. It is known that the infinite self-full ceers properly contain the dark ceers, i.e. the infinite ceers which do not admit an infinite computably enumerable transversal. Unlike the collection of dark ceers

    更新日期:2020-04-22
  • Elementary cellular automata and self-referential paradoxes
    J. Log. Comput. (IF 0.803) Pub Date : 2020-04-16
    MING HSIUNG

    We associate an elementary cellular automaton with a set of self-referential sentences, whose revision process is exactly the evolution process of that automaton. A simple but useful result of this connection is that a set of self-referential sentences is paradoxical, iff (the evolution process for) the cellular automaton in question has no fixed points. We sort out several distinct kinds of paradoxes

    更新日期:2020-04-16
  • Losing connection: the modal logic of definable link deletion
    J. Log. Comput. (IF 0.803) Pub Date : 2020-04-15
    Dazhu Li

    In this article, we start with a two-player game that models communication under adverse circumstances in everyday life and study it from the perspective of a modal logic of graphs, where links can be deleted locally according to definitions available to the adversarial player. We first introduce a new language, semantics and some typical validities. We then formulate a new type of first-order translation

    更新日期:2020-04-15
  • Order polarities
    J. Log. Comput. (IF 0.803) Pub Date : 2020-04-15
    Rob Egrot

    We define an order polarity to be a polarity |$(X,Y,{\operatorname{R}})$| where |$X$| and |$Y$| are partially ordered, and we define an extension polarity to be a triple |$(e_X,e_Y,{\operatorname{R}})$| such that |$e_X:P\to X$| and |$e_Y:P\to Y$| are poset extensions and |$(X,Y,{\operatorname{R}})$| is an order polarity. We define a hierarchy of increasingly strong coherence conditions for extension

    更新日期:2020-04-15
  • Decidability of affine solution problems
    J. Log. Comput. (IF 0.803) Pub Date : 2019-01-02
    Stefan Hetzl; Sebastian Zivota

    We present formula equations—first-order formulas with unknowns standing for predicates—as a general formalism for treating certain questions in logic and computer science, like the Auflösungsproblem and loop invariant generation. In the case of the language of affine terms over |$\mathbb{Q}$|⁠, we translate a quantifier-free formula equation into an equivalent statement about affine spaces over |$\mathbb{Q}$|⁠

    更新日期:2019-01-02
Contents have been reproduced by permission of the publishers.
导出
全部期刊列表>>
欢迎访问IOP中国网站
自然职场线上招聘会
GIANT
产业、创新与基础设施
自然科研线上培训服务
材料学研究精选
胸腔和胸部成像专题
屿渡论文,编辑服务
何川
苏昭铭
陈刚
姜涛
李闯创
李刚
北大
隐藏1h前已浏览文章
课题组网站
新版X-MOL期刊搜索和高级搜索功能介绍
ACS材料视界
天合科研
x-mol收录
上海纽约大学
陈芬儿
厦门大学
何振宇
史大永
吉林大学
卓春祥
张昊
杨中悦
试剂库存
down
wechat
bug