Search results
- 1.0556685 - MÚ 2023 RIV DE eng J - Journal Article
Jeřábek, Emil
The theory of hereditarily bounded sets.
Mathematical Logic Quarterly. Roč. 68, č. 2 (2022), s. 243-256. ISSN 0942-5616. E-ISSN 1521-3870
R&D Projects: GA ČR(CZ) GA19-05497S
Institutional support: RVO:67985840
Keywords : hereditarily finite sets * pairing function * decidability
OECD category: Pure mathematics
Impact factor: 0.3, year: 2022
Method of publishing: Limited access
https://doi.org/10.1002/malq.202100020
Permanent Link: http://hdl.handle.net/11104/0330805File Download Size Commentary Version Access Jerabek.pdf 2 473 KB Publisher’s postprint require - 2.0546146 - FLÚ 2022 RIV AU eng J - Journal Article
Tedder, Andrew
On Consistency and Decidability in Some Paraconsistent Arithmetics.
Australasian Journal of Logic. Roč. 18, č. 5 (2021), s. 473-502. E-ISSN 1448-5052
Institutional support: RVO:67985955
Keywords : Consistency * Decidability * Paraconsistent logics * Paraconssistent Arithmetics
OECD category: Philosophy, History and Philosophy of science and technology
Method of publishing: Open access
https://doi.org/10.26686/ajl.v18i5.6921
Permanent Link: http://hdl.handle.net/11104/0322697File Download Size Commentary Version Access 2021_J_0546146.pdf 1 386.1 KB Publisher’s postprint open-access - 3.0505107 - ÚI 2021 RIV NL eng J - Journal Article
Bílková, Marta - Colacito, A.
Proof Theory for Positive Logic with Weak Negation.
Studia Logica. Roč. 108, č. 4 (2020), s. 649-686. ISSN 0039-3215. E-ISSN 1572-8730
R&D Projects: GA ČR GA17-04630S
Institutional support: RVO:67985807
Keywords : Minimal propositional logic * Weak negation * Intuitionistic propositional logic * Sequent calculus * Terminating sequent calculus * Decidability * Complexity
OECD category: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Impact factor: 0.585, year: 2020
Method of publishing: Limited access
http://dx.doi.org/10.1007/s11225-019-09869-y
Permanent Link: http://hdl.handle.net/11104/0296624 - 4.0477047 - ÚI 2019 RIV NL eng J - Journal Article
Moraschini, Tommaso
A Computational Glimpse at the Leibniz and Frege Hierarchies.
Annals of Pure and Applied Logic. Roč. 169, č. 1 (2018), s. 1-20. ISSN 0168-0072. E-ISSN 1873-2461
R&D Projects: GA ČR GA13-14654S
Institutional support: RVO:67985807
Keywords : abstract algebraic logic * Leibniz hierarchy * Frege hierarchy Leibniz congruence * decidability * Diophantine equations * relation algebras
OECD category: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Impact factor: 0.829, year: 2018
Permanent Link: http://hdl.handle.net/11104/0273441File Download Size Commentary Version Access a0477047.pdf 10 463.1 KB Publisher’s postprint require - 5.0473662 - ÚI 2018 RIV US eng J - Journal Article
Horčík, Rostislav
On Square-Increasing Ordered Monoids and Idempotent Semirings.
Semigroup Forum. Roč. 94, č. 2 (2017), s. 297-313. ISSN 0037-1912. E-ISSN 1432-2137
R&D Projects: GA ČR GAP202/11/1632
Institutional support: RVO:67985807
Keywords : idempotent semiring * ordered monoid * universal theory * finite embeddability property * decidability
OECD category: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Impact factor: 0.492, year: 2017
Permanent Link: http://hdl.handle.net/11104/0270794 - 6.0459689 - ÚI 2017 RIV CH eng A - Abstract
Ratschan, Stefan
Decidability from a Numerical Point of View.
Mathematical Aspects of Computer and Information Sciences. Springer, 2016 - (Kotsireas, I.; Rump, S.; Yao, C.). XVI-XVI. ISBN 978-3-319-32858-4. ISSN 0302-9743.
[MACIS 2015. International Conference on Mathematical Aspects of Computer and Information Sciences /6./. 11.11.2015-13.11.2015, Berlin]
R&D Projects: GA ČR GA15-14484S
Institutional support: RVO:67985807
Keywords : decidability * numerical computation
Subject RIV: IN - Informatics, Computer Science
http://macis2015.zib.de/invited.html
Permanent Link: http://hdl.handle.net/11104/0259862File Download Size Commentary Version Access a0459689 Ratschan.pdf 6 47.6 KB Publisher’s postprint open-access - 7.0449388 - ÚI 2017 RIV NL eng J - Journal Article
Franek, Peter - Ratschan, Stefan - Zgliczynski, P.
Quasi-Decidability of a Fragment of the First-Order Theory of Real Numbers.
Journal of Automated Reasoning. Roč. 57, č. 2 (2016), s. 157-185. ISSN 0168-7433. E-ISSN 1573-0670
R&D Projects: GA ČR GCP202/12/J060; GA MŠMT OC10048; GA ČR GA15-14484S
Institutional support: RVO:67985807
Keywords : decidability * decision procedure * real numbers
Subject RIV: IN - Informatics, Computer Science
Impact factor: 1.636, year: 2016
Permanent Link: http://hdl.handle.net/11104/0250958File Download Size Commentary Version Access a0449388.pdf 9 702.4 KB Publisher’s postprint require - 8.0442807 - ÚI 2017 RIV US eng J - Journal Article
Chvalovský, Karel - Horčík, Rostislav
Full Lambek Calculus with Contraction is Undecidable.
Journal of Symbolic Logic. Roč. 81, č. 2 (2016), s. 524-540. ISSN 0022-4812. E-ISSN 1943-5886
R&D Projects: GA ČR GAP202/11/1632
Institutional support: RVO:67985807
Keywords : substructural logic * full Lambek calculus * contraction rule * square-increasing residuated lattice * equational theory * decidability
Subject RIV: BA - General Mathematics
Impact factor: 0.511, year: 2016
Permanent Link: http://hdl.handle.net/11104/0245628File Download Size Commentary Version Access a0442807.pdf 8 369.7 KB Publisher’s postprint require - 9.0423370 - ÚI 2014 RIV US eng J - Journal Article
Ratschan, Stefan
Safety verification of non-linear hybrid systems is quasi-decidable.
Formal Methods in System Design. Roč. 44, č. 1 (2014), s. 71-90. ISSN 0925-9856. E-ISSN 1572-8102
R&D Projects: GA ČR GCP202/12/J060
Institutional support: RVO:67985807
Keywords : hybrid systems * safety verification * decidability * robustness
Subject RIV: IN - Informatics, Computer Science
Impact factor: 0.875, year: 2014
Permanent Link: http://hdl.handle.net/11104/0229467 - 10.0381410 - ÚI 2013 JP eng A - Abstract
Horčík, Rostislav
Quasiequational Theory of Square-increasing Residuated Lattices is Undecidable.
Logic, Algebra and Truth Degrees 2012. Book of Abstracts. JAIST, 2012 - (Terui, K.; Preining, N.). s. 2-2
[Logic, Algebra and Truth Degrees 2012. 10.09.2012-14.09.2012, Kanazawa]
Institutional support: RVO:67985807
Keywords : residuated lattices * decidability * quasiequational theory
Subject RIV: BA - General Mathematics
Permanent Link: http://hdl.handle.net/11104/0007308