当前期刊: Journal of Logic and Computation Go to current issue    加入关注   
显示样式:        排序: IF: - GO 导出
我的关注
我的收藏
您暂时未登录!
登录
  • First-order swap structures semantics for some logics of formal inconsistency
    J. Log. Comput. (IF 0.509) 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
  • Sette’s calculus P1 and some hierarchies of paraconsistent systems
    J. Log. Comput. (IF 0.509) Pub Date : 2020-06-03
    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-06-03
  • Space and time complexity for infinite time Turing machines
    J. Log. Comput. (IF 0.509) 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
  • Individual resource games and resource redistributions
    J. Log. Comput. (IF 0.509) 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-05-28
  • A study of possible-worlds semantics of relevance-sensitive belief revision
    J. Log. Comput. (IF 0.509) 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-05-25
  • Self-full ceers and the uniform join operator
    J. Log. Comput. (IF 0.509) 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.509) 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.509) 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.509) 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.509) 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.
导出
全部期刊列表>>
Springer化学材料学
骄傲月
如何通过Nature平台传播科研成果
跟Nature、Science文章学绘图
隐藏1h前已浏览文章
中洪博元
课题组网站
新版X-MOL期刊搜索和高级搜索功能介绍
ACS材料视界
x-mol收录
南开大学
朱守非
廖良生
郭东升
汪铭
伊利诺伊大学香槟分校
徐明华
中山大学化学工程与技术学院
试剂库存
天合科研
down
wechat
bug