Zobrazeno 1 - 10
of 280
pro vyhledávání: '"Non-standard model of arithmetic"'
Autor:
Jarmoc, Michał
Publikováno v:
Rocznik Kognitywistyczny / Yearbook of Cognitive Science. (10):1-14
Externí odkaz:
https://www.ceeol.com/search/article-detail?id=707198
Autor:
Tzouvaras, Athanassios
Publikováno v:
Studia Logica: An International Journal for Symbolic Logic, 2005 Jun 01. 80(1), 121-141.
Externí odkaz:
https://www.jstor.org/stable/20016708
Publikováno v:
Theoretical computer science, 2017, Vol.703, pp.18-36 [Peer Reviewed Journal]
We study interactions between Skolem Arithmetic and certain classes of Circuit Satisfiability and Constraint Satisfaction Problems (CSPs). We revisit results of Glaser et al. [1] in the context of CSPs and settle the major open question from that pap
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9ba713f1bc898c4cdb1300c28c20a8f1
https://doi.org/10.1016/j.tcs.2017.08.025
https://doi.org/10.1016/j.tcs.2017.08.025
Autor:
A. N. Rybalov
Publikováno v:
Algebra and Logic. 56:232-235
Gӧdel’s incompleteness theorem asserts that if formal arithmetic is consistent then there exists an arithmetic statement such that neither the statement nor its negation can be deduced from the axioms of formal arithmetic. Previously [3], it was p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4eca74cced2afa17cb743de38d4ede82
https://doi.org/10.1007/s10469-017-9442-9
https://doi.org/10.1007/s10469-017-9442-9
Autor:
Ali Enayat, Tin Lok Wong
Publikováno v:
Annals of Pure and Applied Logic. 168:1247-1283
We develop machinery to make the Arithmetized Completeness Theorem more effective in the study of many models of I Δ 0 + B Σ 1 + exp , including all countable ones, by passing on to the conservative extension WKL 0 ⁎ of I Δ 0 + B Σ 1 + exp . Ou
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bcb883f12c5c7eeb5d7407cd7879e87d
https://doi.org/10.1016/j.apal.2016.12.003
https://doi.org/10.1016/j.apal.2016.12.003
Autor:
Antonio M. Oller-Marcén
Publikováno v:
Mathematica Bohemica, Vol 142, Iss 1, Pp 21-25 (2017)
A homothetic arithmetic function of ratio $K$ is a function $f\colon \mathbb {N}\rightarrow R$ such that $f(Kn)=f(n)$ for every $n\in \mathbb {N}$. Periodic arithmetic funtions are always homothetic, while the converse is not true in general. In this
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8282e89da90e70ba8313c42411ea34e3
http://mb.math.cas.cz/full/142/1/mb142_1_3.pdf
http://mb.math.cas.cz/full/142/1/mb142_1_3.pdf
Autor:
Valentin Blot
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783642389450
TLCA
Typed Lambda Calculi and Applications
Typed Lambda Calculi and Applications, Jun 2013, Eindhoven, Netherlands. pp.77-92, ⟨10.1007/978-3-642-38946-7_8⟩
TLCA
Typed Lambda Calculi and Applications
Typed Lambda Calculi and Applications, Jun 2013, Eindhoven, Netherlands. pp.77-92, ⟨10.1007/978-3-642-38946-7_8⟩
We build a realizability model for Peano arithmetic based on winning conditions for HON games. Our winning conditions are sets of desequentialized interactions which we call positions. We define a notion of winning strategies on arenas equipped with
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b3c0f841d3a79c063da1ad52297d527f
https://doi.org/10.1016/j.apal.2016.10.006
https://doi.org/10.1016/j.apal.2016.10.006
Autor:
Ermek S. Nurkhaidarov
Publikováno v:
Mathematical Logic Quarterly. 61:179-188
The main result of this paper partially answers a question raised in [11] about the existence of countable just recursively saturated models of Peano Arithmetic with non-isomorphic automorphism groups. We show the existence of infinitely many countab
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c0aa698bcdb5b152699a74d3ee84f29f
https://doi.org/10.1002/malq.201400008
https://doi.org/10.1002/malq.201400008
Autor:
Adrian Ludușan
Publikováno v:
Logos & Episteme. 6:313-332
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6282eea0dbb93602786d665dc0960ce1
https://doi.org/10.5840/logos-episteme20156324
https://doi.org/10.5840/logos-episteme20156324
