×

Found 80 Documents (Results 1–80)

100
MathJax

A proof of Bel’tyukov-Lipshitz theorem by quasi-quantifier elimination. II: The main reduction. (English. Russian original) Zbl 1491.03012

Vestn. St. Petersbg. Univ., Math. 54, No. 4, 372-380 (2021); translation from Vestn. St-Peterbg. Univ., Ser. I, Mat. Mekh. Astron. 8(66), No. 4, 608-619 (2021).
PDF BibTeX XML Cite
Full Text: DOI

A proof of Bel’tyukov-Lipshitz theorem by quasi-quantifier elimination. I: Definitions and GCD-lemma. (English. Russian original) Zbl 1491.03011

Vestn. St. Petersbg. Univ., Math. 54, No. 3, 264-272 (2021); translation from Vestn. St-Peterbg. Univ., Ser. I, Mat. Mekh. Astron. 8(66), No. 3, 455-466 (2021).
PDF BibTeX XML Cite
Full Text: DOI

Bisimilarity of diagrams. (English) Zbl 07578335

Fahrenberg, Uli (ed.) et al., Relational and algebraic methods in computer science. 18th international conference, RAMiCS 2020, Palaiseau, France, October 26–29, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12062, 65-81 (2020).
MSC:  68Qxx
PDF BibTeX XML Cite
Full Text: DOI

Ordinal analysis of intuitionistic power and exponentiation Kripke Platek set theory. (English) Zbl 1439.03108

Kahle, Reinhard (ed.) et al., Advances in proof theory. Proceedings of the symposium, on the occasion of the 60th birthday of Gerhard Jäger, Bern, Switzerland, December 13–14, 2013. Basel: Birkhäuser/Springer. Prog. Comput. Sci. Appl. Log. 28, 79-172 (2016).
PDF BibTeX XML Cite
Full Text: DOI arXiv Link

Logical aspects of the theory of divisible rigid groups. (English. Russian original) Zbl 1319.20032

Dokl. Math. 90, No. 3, 697-698 (2014); translation from Dokl. Akad. Nauk, Ross. Akad. Nauk 459, No. 2, 154-155 (2014).
PDF BibTeX XML Cite
Full Text: DOI

Universal theories for rigid soluble groups. (English. Russian original) Zbl 1263.20034

Algebra Logic 50, No. 6, 539-552 (2012); translation from Algebra Logika 50, No. 6, 802-821 (2011).
PDF BibTeX XML Cite
Full Text: DOI

Complexity of existential positive first-order logic. (English) Zbl 1268.03048

Ambos-Spies, Klaus (ed.) et al., Mathematical theory and computational practice. 5th conference on computability in Europe, CiE 2009, Heidelberg, Germany, July 19–24, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-03072-7/pbk). Lecture Notes in Computer Science 5635, 31-36 (2009).
PDF BibTeX XML Cite
Full Text: DOI arXiv

Decision problems in algebra and analogues of Hilbert’s tenth problem. (English) Zbl 1167.03008

Chatzidakis, Zoé (ed.) et al., Model theory with applications to algebra and analysis. Vol. 2. Cambridge: Cambridge University Press (ISBN 978-0-521-70908-8/pbk). London Mathematical Society Lecture Note Series 350, 207-235 (2008).
MSC:  03B25 03C60 11U05
PDF BibTeX XML Cite

Undecidability of type-checking in domain-free typed lambda-calculi with existence. (English) Zbl 1156.03316

Kaminski, Michael (ed.) et al., Computer science logic. 22nd international workshop, CSL 2008, 17th annual conference of the EACSL, Bertinoro, Italy, September 16–19, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-87530-7/pbk). Lecture Notes in Computer Science 5213, 478-492 (2008).
PDF BibTeX XML Cite
Full Text: DOI

Word equations over graph products. (English) Zbl 1188.20066

Pandya, Paritosh K. (ed.) et al., FST TCS 2003: Foundations of software technology and theoretical computer science. 23rd conference, Mumbai, India, December 15–17, 2003. Proceedings. Berlin: Springer (ISBN 3-540-20680-9/pbk). Lect. Notes Comput. Sci. 2914, 156-167 (2003).
PDF BibTeX XML Cite
Full Text: DOI

An effort to prove that the existential theory of \(\mathbb Q\) is undecidable. (English) Zbl 0981.03014

Denef, Jan (ed.) et al., Hilbert’s tenth problem: relations with arithmetic and algebraic geometry. Proceedings of the workshop, Ghent University, Belgium, November 2-5, 1999. Providence, RI: American Mathematical Society (AMS). Contemp. Math. 270, 237-252 (2000).
MSC:  03B25 12L05 11U05
PDF BibTeX XML Cite

Undecidability of existential theories of rings and fields: A survey. (English) Zbl 0981.03013

Denef, Jan (ed.) et al., Hilbert’s tenth problem: relations with arithmetic and algebraic geometry. Proceedings of the workshop, Ghent University, Belgium, November 2-5, 1999. Providence, RI: American Mathematical Society (AMS). Contemp. Math. 270, 49-105 (2000).
PDF BibTeX XML Cite

A new result about the decidability of the existential one-step rewriting theory. (English) Zbl 0939.03012

Narendran, Paliath (ed.) et al., Rewriting techniques and applications. 10th international conference, RTA-99. Trento, Italy, July 2-4, 1999. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1631, 118-132 (1999).
MSC:  03B25 68Q42
PDF BibTeX XML Cite

Deciding the satisfiability of quantifier free formulae on one-step rewriting. (English) Zbl 0939.03011

Narendran, Paliath (ed.) et al., Rewriting techniques and applications. 10th international conference, RTA-99. Trento, Italy, July 2-4, 1999. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1631, 103-117 (1999).
MSC:  03B25 68Q42
PDF BibTeX XML Cite

A modal logic of relations. (With appendix: “Mosaics and step-by-step”, by Robin Hirsch, Ian Hodkinson, Maarten Marx, Szabolcs Mikulás and Mark Reynolds). (English) Zbl 0924.03030

Orłowska, Ewa (ed.), Logic at work. Essays dedicated to the memory of Helena Rasiowa. Heidelberg: Physica-Verlag. Stud. Fuzziness Soft Comput. 24, 124-167 (1999).
Reviewer: G.Mints (Stanford)
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