×

Found 128 Documents (Results 1–100)

100
MathJax

Completeness of Hoare logic relative to the standard model. (English) Zbl 1444.03122

Steffen, Bernhard (ed.) et al., SOFSEM 2017: theory and practice of computer science. 43rd international conference on current trends in theory and practice of computer science, Limerick, Ireland, January 16–20, 2017, Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10139, 119-131 (2017).
MSC:  03B70 03C62 03F30
PDF BibTeX XML Cite
Full Text: DOI arXiv

Algebraic computability and enumeration models. Recursion theory and descriptive complexity. (English) Zbl 1439.03006

Boca Raton, FL: CRC Press/Apple Academic Press (ISBN 978-1-77188-247-7/hbk; 978-1-77188-248-4/ebook). xiv, 295 p. (2016).
PDF BibTeX XML Cite
Full Text: DOI

On the computability of Solomonoff induction and knowledge-seeking. (English) Zbl 1388.68252

Chaudhuri, Kamalika (ed.) et al., Algorithmic learning theory. 26th international conference, ALT 2015, Banff, AB, Canada, October 4–6, 2015. Proceedings. Cham: Springer (ISBN 978-3-319-24485-3/pbk; 978-3-319-24486-0/ebook). Lecture Notes in Computer Science 9355. Lecture Notes in Artificial Intelligence, 364-378 (2015).
MSC:  68T05 03D15 68Q30
PDF BibTeX XML Cite
Full Text: DOI arXiv

On complexity of problem of satisfiability for systems of countable-valued functional equations. (English. Russian original) Zbl 1337.39006

Russ. Math. 59, No. 8, 19-24 (2015); translation from Izv. Vyssh. Uchebn. Zaved., Mat. 2015, No. 8, 25–32 (2015).
MSC:  39B72 39B32
PDF BibTeX XML Cite
Full Text: DOI

On Boolean closed full trios and rational Kripke frames. (English) Zbl 1359.68174

Mayr, Ernst W. (ed.) et al., 31st international symposium on theoretical aspects of computer science, STACS’ 14, Lyon, France, March 5–8, 2014. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-65-1). LIPIcs – Leibniz International Proceedings in Informatics 25, 530-541 (2014).
MSC:  68Q45
PDF BibTeX XML Cite
Full Text: DOI

On computability and learnability of the pumping lemma function. (English) Zbl 1407.68260

Dediu, Adrian-Horia (ed.) et al., Language and automata theory and applications. 8th international conference, LATA 2014, Madrid, Spain, March 10–14, 2014. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 8370, 433-440 (2014).
MSC:  68Q45 03D20 68Q32
PDF BibTeX XML Cite
Full Text: DOI

The exact hardness of deciding derivational and runtime complexity. (English) Zbl 1247.03072

Bezem, Marc (ed.), Computer science logic (CSL’11). 25th international workshop, 20th annual conference of the EACSL, Bergen, Norway, September 12–15, 2011. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-32-3). LIPIcs – Leibniz International Proceedings in Informatics 12, 481-495, electronic only (2011).
MSC:  03D15 03B25 68Q42
PDF BibTeX XML Cite
Full Text: DOI Link

Cartesian monoids. (English) Zbl 1343.03047

Mislove, Michael (ed.) et al., Proceedings of the 26th conference on the mathematical foundations of programming semantics (MFPS 2010), Ottawa, Canada, May 6–10, 2010. Amsterdam: Elsevier. Electronic Notes in Theoretical Computer Science 265, 437-451 (2010).
MSC:  03G25 03B40 68N30
PDF BibTeX XML Cite
Full Text: DOI

On equations over sets of integers. (English) Zbl 1230.68132

Marion, Jean-Yves (ed.) et al., STACS 2010. 27th international symposium on theoretical aspects of computer science, Nancy, France, March 4–6, 2010. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-16-3). LIPIcs – Leibniz International Proceedings in Informatics 5, 477-488, electronic only (2010).
MSC:  68Q45 03B70
PDF BibTeX XML Cite
Full Text: DOI Link

Infinite computations and a hierarchy in \(\Delta _{3}\). (English) Zbl 1150.03316

Cooper, S. Barry (ed.) et al., Computation and logic in the real world. Third conference on computability in Europe, CiE 2007, Siena, Italy, June 18–23, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-73000-2/pbk). Lecture Notes in Computer Science 4497, 660-669 (2007).
MSC:  03D10 03D55 03D05
PDF BibTeX XML Cite
Full Text: DOI

The complexity of quickly ORM-decidable sets. (English) Zbl 1150.03321

Cooper, S. Barry (ed.) et al., Computation and logic in the real world. Third conference on computability in Europe, CiE 2007, Siena, Italy, June 18–23, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-73000-2/pbk). Lecture Notes in Computer Science 4497, 488-496 (2007).
MSC:  03D60 03D10 03D55
PDF BibTeX XML Cite
Full Text: DOI Link

Forecasting black holes in abstract geometrical computation is highly unpredictable. (English) Zbl 1117.03045

Cai, Jin-Yi (ed.) et al., Theory and applications of models of computation. Third international conference, TAMC 2006, Beijing, China, May 15–20, 2006. Proceedings. Berlin: Springer (ISBN 3-540-34021-1/pbk). Lecture Notes in Computer Science 3959, 644-653 (2006).
MSC:  03D10 68Q05 68Q80
PDF BibTeX XML Cite
Full Text: DOI

The intuitionistic arithmetical hierarchy. (English) Zbl 1061.03064

van Eijck, Jan (ed.) et al., Logic colloquium ’99. Proceedings of the annual European summer meeting of the Association for Symbolic Logic, Utrecht, Netherlands, August 1–6, 1999. Natick, MA: A K Peters; Urbana, IL: Association for Symbolic Logic (ISBN 1-56881-203-5/pbk; 1-56881-199-3/hbk). Lecture Notes in Logic 17, 51-59 (2004).
MSC:  03F30 03F55
PDF BibTeX XML Cite

The arithmetical hierarchy of real numbers. (English) Zbl 0955.03066

Kutyłowski, Mirosław (ed.) et al., Mathematical foundations of computer science 1999. 24th international symposium, MFCS ’99, Szklarska Porȩba, Poland, September 6-10, 1999. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1672, 23-33 (1999).
MSC:  03F60 03D55 26E40
PDF BibTeX XML Cite

Mathematical definability. (English) Zbl 0932.03054

Dales, H. G. (ed.) et al., Truth in mathematics. Lectures of a conference, Mussomeli, Sicily, Italy, September 13–20, 1995. Oxford: Clarendon Press. Oxford Science Publications. 233-251 (1998).
PDF BibTeX XML Cite

Combinatorial number theory. A treatise on growth, based on the Goodstein-Skolem hierarchy, including a critique of non-constructive or first-order logic. Corr. reprint of the 1994 ed. (English) Zbl 0861.03045

Lewiston, NY: Edwin Mellen Press. ii, 430 p. (1996).
PDF BibTeX XML Cite

Combinatorial number theory. A treatise on growth, based on the Goodstein-Skolem hierarchy, incl. a critique of non-constructive or first-order logic. (English) Zbl 0829.03039

Lampeter, Dyfed, Wales: Edwin Mellen Press, Ltd. 430 p. (1994).
PDF BibTeX XML Cite

Recursive functions and elements of metamathematics. Problems of completeness, decidability and Gödel’s theorems. (Funkcje rekurencyjne i elementy metamatematyki. Problemy zupełności, rozstrzygalności, twierdzenia Gödla.) (Polish) Zbl 0719.03001

Seria Matematyka, Uniwersytet Im. Adama Mickiewicza w Poznaniu, 11. Poznań: Wydawnictwo Naukowe Uniwersytetu Im. Adama Mickiewicza w Poznaniu. 186 p. (1990).
PDF BibTeX XML Cite

Filter Results by …

Document Type

Reviewing State

all top 5

Author

all top 5

Year of Publication

all top 3

Classification

Software