Logic
ARTICLE

doi:10.20944/preprints202007.0415.v3
Subject:
Mathematics & Computer Science,
Logic
Keywords:
Structuralism; Set Theory; Type Theory; Arithmetic Model; Data Type; Tree, Group
Online: 20 September 2021 (15:11:14 CEST)
Mon, 17 May 2021
SHORT NOTE
Subject:
Mathematics & Computer Science,
Logic
Keywords:
Automate Warehouse; KRR; Answer Set Programming; Clingo; ASPRILO; Behavior Driven Development
Online: 17 May 2021 (10:53:59 CEST)
Wed, 3 March 2021
REVIEW

doi:10.20944/preprints202103.0133.v1
Online: 3 March 2021 (13:33:33 CET)
Tue, 27 October 2020
ARTICLE

doi:10.20944/preprints202010.0560.v1
Subject:
Mathematics & Computer Science,
Logic
Keywords:
satisfiability; SAT; fractal dimension; complex networks
Online: 27 October 2020 (16:12:41 CET)
Tue, 1 September 2020
REVIEW
Online: 1 September 2020 (04:32:24 CEST)
Fri, 14 August 2020
ARTICLE

doi:10.20944/preprints202006.0276.v2
Subject:
Mathematics & Computer Science,
Logic
Keywords:
Primes; Distribution of Primes; Primes and integers; Additive questions involving primes; Number representations
Online: 14 August 2020 (03:44:15 CEST)
Tue, 4 August 2020
REVIEW

doi:10.20944/preprints202008.0082.v1
Online: 4 August 2020 (08:44:36 CEST)
Sun, 21 June 2020
ARTICLE

doi:10.20944/preprints202006.0276.v1
Subject:
Mathematics & Computer Science,
Logic
Keywords:
Primes; Distribution of Primes; Primes and integers; Additive questions involving primes; Number representations
Online: 21 June 2020 (14:52:12 CEST)
Tue, 25 February 2020
ARTICLE
Subject:
Mathematics & Computer Science,
Logic
Keywords:
Alexander Zenkin's superinduction method; arithmetical operations on huge integers cannot be performed by any physical process; computable set {${\mathcal X} \subseteq N$} whose finiteness remains conjectured; computable set {${\mathcal X} \subseteq N$} whose infiniteness remains conjectured
Online: 25 February 2020 (10:06:45 CET)
Wed, 5 June 2019
ARTICLE

doi:10.20944/preprints201811.0301.v8
Subject:
Mathematics & Computer Science,
Logic
Keywords:
Brocard's problem; BrocardRamanujan equation $x!+1=y^2$; composite Fermat numbers; Erd\"os' equation $x(x+1)=y!$; prime numbers of the form $n^2+1$; prime numbers of the form $n!+1$; Sophie Germain primes; twin primes
Online: 5 June 2019 (08:37:55 CEST)
Tue, 9 April 2019
ARTICLE
Subject:
Mathematics & Computer Science,
Logic
Keywords:
Brocard's problem; BrocardRamanujan equation $x!+1=y^2$; composite Fermat numbers; Erd\"os' equation $x(x+1)=y!$; prime numbers of the form $n^2+1$; prime numbers of the form $n!+1$; Sophie Germain primes; twin primes
Online: 9 April 2019 (05:40:44 CEST)
Fri, 1 March 2019
ARTICLE

doi:10.20944/preprints201902.0156.v4
Subject:
Mathematics & Computer Science,
Logic
Keywords:
DavisPutnamRobinsonMatiyasevich theorem, Diophantine equation which has at most finitely many solutions in \mbox{nonnegative} integers, Hilbert's Tenth Problem, Hilbert's Tenth Problem for Q, Matiyasevich's theorem, recursively enumerable set, Smorynski's theorem
Online: 1 March 2019 (12:58:53 CET)
Mon, 25 February 2019
ARTICLE

doi:10.20944/preprints201902.0156.v3
Subject:
Mathematics & Computer Science,
Logic
Keywords:
DavisPutnamRobinsonMatiyasevich theorem, Diophantine equation which has at most finitely many solutions in \mbox{nonnegative} integers, Hilbert's Tenth Problem, Hilbert's Tenth Problem for Q, Matiyasevich's theorem, recursively enumerable set, Smorynski's theorem
Online: 25 February 2019 (15:09:05 CET)
Tue, 19 February 2019
ARTICLE

doi:10.20944/preprints201902.0156.v2
Subject:
Mathematics & Computer Science,
Logic
Keywords:
DavisPutnamRobinsonMatiyasevich theorem, Diophantine equation which has at most finitely many solutions in \mbox{nonnegative} integers, Hilbert's Tenth Problem, Hilbert's Tenth Problem for Q, Matiyasevich's theorem, recursively enumerable set, Smorynski's theorem
Online: 19 February 2019 (11:16:51 CET)
Mon, 18 February 2019
ARTICLE

doi:10.20944/preprints201902.0159.v1
Subject:
Mathematics & Computer Science,
Logic
Keywords:
Density elimination; Involutive uninorm logic; Standard completeness of IUL; Semilinear substructural logics; Fuzzy logic
Online: 18 February 2019 (10:44:53 CET)
ARTICLE

doi:10.20944/preprints201902.0158.v1
Subject:
Mathematics & Computer Science,
Logic
Keywords:
Density elimination; Pseudouninorm logic; Standard completeness of HpsUL∗; Substructural logics; Fuzzy logic
Online: 18 February 2019 (10:42:15 CET)
ARTICLE

doi:10.20944/preprints201902.0156.v1
Subject:
Mathematics & Computer Science,
Logic
Keywords:
DavisPutnamRobinsonMatiyasevich theorem, Diophantine equation which has at most finitely many solutions in \mbox{nonnegative} integers, Hilbert's Tenth Problem, Hilbert's Tenth Problem for Q, Matiyasevich's theorem, recursively enumerable set, Smorynski's theorem
Online: 18 February 2019 (10:34:28 CET)
Thu, 10 January 2019
ARTICLE

doi:10.20944/preprints201811.0301.v6
Subject:
Mathematics & Computer Science,
Logic
Keywords:
Brocard's problem; BrocardRamanujan equation $x!+1=y^2$; composite Fermat numbers; Erdös' equation $x(x+1)=y!$; prime numbers of the form $n^2+1$; prime numbers of the form $n!+1$; Richert's lemma; Sophie Germain primes; Wilson primes; twin prime conjecture
Online: 10 January 2019 (07:08:38 CET)
Thu, 3 January 2019
ARTICLE

doi:10.20944/preprints201811.0301.v5
Subject:
Mathematics & Computer Science,
Logic
Keywords:
Brocard's problem; BrocardRamanujan equation $x!+1=y^2$; composite Fermat numbers; Erdös' equation $x(x+1)=y!$; prime numbers of the form $n^2+1$; prime numbers of the form $n!+1$; Richert's lemma; twin prime conjecture
Online: 3 January 2019 (09:43:19 CET)
Thu, 29 November 2018
ARTICLE

doi:10.20944/preprints201811.0301.v4
Subject:
Mathematics & Computer Science,
Logic
Keywords:
Brocard's problem; BrocardRamanujan equation; composite Fermat numbers; halting of a Turing machine; prime numbers of the form $n^2+1$; prime numbers of the form $n!+1$; Richert's lemma; twin prime conjecture
Online: 29 November 2018 (05:28:14 CET)
Tue, 20 November 2018
ARTICLE

doi:10.20944/preprints201811.0301.v3
Subject:
Mathematics & Computer Science,
Logic
Keywords:
Brocard's problem; BrocardRamanujan equation; composite Fermat numbers; Dickson's conjecture; halting of a Turing machine; prime numbers of the form $n^2+1$; prime numbers of the form $n!+1$; Richert's lemma; twin prime conjecture
Online: 20 November 2018 (06:57:27 CET)
Fri, 16 November 2018
ARTICLE

doi:10.20944/preprints201811.0301.v2
Subject:
Mathematics & Computer Science,
Logic
Keywords:
Brocard's problem; BrocardRamanujan equation; composite Fermat numbers; Dickson's conjecture; halting of a Turing machine; prime numbers of the form $n^2+1$; prime numbers of the form $n!+1$; Richert's lemma; twin prime conjecture
Online: 16 November 2018 (11:40:40 CET)
Tue, 13 November 2018
ARTICLE

doi:10.20944/preprints201811.0317.v1
Subject:
Mathematics & Computer Science,
Logic
Keywords:
Substructural fuzzy logics; Residuated lattices; Semilinear substructural logics; Standard completeness; Fuzzy logic
Online: 13 November 2018 (14:51:05 CET)
ARTICLE

doi:10.20944/preprints201811.0301.v1
Subject:
Mathematics & Computer Science,
Logic
Keywords:
Brocard's problem; BrocardRamanujan equation; composite Fermat numbers; Dickson's conjecture; halting of a Turing machine; prime numbers of the form $n^2+1$; prime numbers of the form $n!+1$; Richert's lemma; twin prime conjecture
Online: 13 November 2018 (06:58:44 CET)
Fri, 9 November 2018
ARTICLE

doi:10.20944/preprints201811.0226.v1
Subject:
Mathematics & Computer Science,
Logic
Keywords:
intuitionistic logic; quantum computing; Kripkestyle semantics
Online: 9 November 2018 (03:03:59 CET)
Wed, 13 December 2017
ARTICLE

doi:10.20944/preprints201712.0079.v1
Subject:
Mathematics & Computer Science,
Logic
Keywords:
Łukasiewicz logic; semantics; fuzzifying topology; fuzzifying compactness; strong compactness; fuzzifying locally compactness; locally strong compactness
Online: 13 December 2017 (06:43:52 CET)
Wed, 27 September 2017
ARTICLE

doi:10.20944/preprints201709.0127.v2
Subject:
Mathematics & Computer Science,
Logic
Keywords:
DavisPutnan RobinsonMatiyasevich theorem; Diophantine equation which has at most finitely many solutions in nonnegative integers; Diophantine equation which has at most finitely many solutions in positive integers; Diophantine equation which has at most finitely many integer solutions; Hilbert’s Tenth Problem; Matiyasevich’s theorem; recursively enumerable set; Smoryński’s theorem
Online: 27 September 2017 (04:05:45 CEST)
Tue, 26 September 2017
ARTICLE

doi:10.20944/preprints201709.0127.v1
Subject:
Mathematics & Computer Science,
Logic
Keywords:
Diophantine equation which has at most finitely many solutions in nonnegative integers; Diophantine equation which has at most finitely many solutions in positive integers; Diophantine equation which has at most finitely many integer solutions; Hilbert’s Tenth Problem; Matiyasevich’s theorem; recursively enumerable set; Smoryński’s theorem
Online: 26 September 2017 (04:44:11 CEST)
Sun, 5 February 2017
ARTICLE

doi:10.20944/preprints201702.0017.v1
Subject:
Mathematics & Computer Science,
Logic
Keywords:
neutrosophy; neutrosophic logic; neutrosophic alethic modalities; neutrosophic possibility; neutrosophic necessity; neutrosophic impossibility; neutrosophic temporal modalities; neutrosophic epistemic modalities; neutrosophic doxastic modalities; neutrosophic deontic modalities
Online: 5 February 2017 (09:41:31 CET)
Fri, 26 August 2016
ARTICLE

doi:10.20944/preprints201608.0208.v1
Subject:
Mathematics & Computer Science,
Logic
Keywords:
quantum structures; effect algebras; fuzzy sets; independence
Online: 26 August 2016 (11:18:02 CEST)
Weekly/Monthly article feeds
Choose the subject area that interest you and we will send you notifications of new preprints at your preferred frequency.