Kartas, Konstantinos An undecidability result for the asymptotic theory of \(p\)-adic fields. (English) Zbl 1516.12002 Ann. Pure Appl. Logic 174, No. 2, Article ID 103203, 13 p. (2023). Reviewer: Xavier Vidaux (Concepción) MSC: 12L05 12J10 03C60 03D35 PDFBibTeX XMLCite \textit{K. Kartas}, Ann. Pure Appl. Logic 174, No. 2, Article ID 103203, 13 p. (2023; Zbl 1516.12002) Full Text: DOI arXiv
Wires, Alexander Complexity in Young’s lattice. (English) Zbl 07483256 Ann. Pure Appl. Logic 173, No. 4, Article ID 103075, 19 p. (2022). MSC: 03C15 03C50 03D35 05A17 06A07 PDFBibTeX XMLCite \textit{A. Wires}, Ann. Pure Appl. Logic 173, No. 4, Article ID 103075, 19 p. (2022; Zbl 07483256) Full Text: DOI arXiv
Kuznetsov, Stepan L.; Speranski, Stanislav O. Infinitary action logic with exponentiation. (English) Zbl 07458791 Ann. Pure Appl. Logic 173, No. 2, Article ID 103057, 29 p. (2022). MSC: 03B47 03C75 03D35 03F52 PDFBibTeX XMLCite \textit{S. L. Kuznetsov} and \textit{S. O. Speranski}, Ann. Pure Appl. Logic 173, No. 2, Article ID 103057, 29 p. (2022; Zbl 07458791) Full Text: DOI arXiv
Flood, Stephen Ordinals and graph decompositions. (English) Zbl 1422.03060 Ann. Pure Appl. Logic 168, No. 4, 824-839 (2017). MSC: 03B80 05C63 03D80 03D15 03D35 PDFBibTeX XMLCite \textit{S. Flood}, Ann. Pure Appl. Logic 168, No. 4, 824--839 (2017; Zbl 1422.03060) Full Text: DOI
Blass, Andreas Symbioses between mathematical logic and computer science. (English) Zbl 1402.03035 Ann. Pure Appl. Logic 167, No. 10, 868-878 (2016). MSC: 03B70 03B60 03D70 03C80 68Q19 PDFBibTeX XMLCite \textit{A. Blass}, Ann. Pure Appl. Logic 167, No. 10, 868--878 (2016; Zbl 1402.03035) Full Text: DOI
Buser, Peter; Scarpellini, Bruno Undecidability through Fourier series. (English) Zbl 1403.03064 Ann. Pure Appl. Logic 167, No. 7, 507-524 (2016). MSC: 03D25 03D35 03D78 03D80 42B05 11Y55 33E05 PDFBibTeX XMLCite \textit{P. Buser} and \textit{B. Scarpellini}, Ann. Pure Appl. Logic 167, No. 7, 507--524 (2016; Zbl 1403.03064) Full Text: DOI
Solovay, Robert M.; Arthan, R. D.; Harrison, John Some new results on decidability for elementary algebra and geometry. (English) Zbl 1259.03020 Ann. Pure Appl. Logic 163, No. 12, 1765-1802 (2012). Reviewer: J. M. Plotkin (East Lansing) MSC: 03B25 03C10 03C65 PDFBibTeX XMLCite \textit{R. M. Solovay} et al., Ann. Pure Appl. Logic 163, No. 12, 1765--1802 (2012; Zbl 1259.03020) Full Text: DOI arXiv
Shafer, Paul Coding true arithmetic in the Medvedev degrees of \(\Pi^0_1\) classes. (English) Zbl 1243.03059 Ann. Pure Appl. Logic 163, No. 3, 321-337 (2012). Reviewer: Roman Murawski (Poznań) MSC: 03D30 03D35 03F30 PDFBibTeX XMLCite \textit{P. Shafer}, Ann. Pure Appl. Logic 163, No. 3, 321--337 (2012; Zbl 1243.03059) Full Text: DOI
Berardi, Stefano; Coquand, Thierry; Hayashi, Susumu Games with 1-backtracking. (English) Zbl 1241.03006 Ann. Pure Appl. Logic 161, No. 10, 1254-1269 (2010). Reviewer: Jeffry L. Hirst (Boone) MSC: 03B30 03D35 03F35 03F60 91A43 PDFBibTeX XMLCite \textit{S. Berardi} et al., Ann. Pure Appl. Logic 161, No. 10, 1254--1269 (2010; Zbl 1241.03006) Full Text: DOI
Bresolin, Davide; Goranko, Valentin; Montanari, Angelo; Sciavicco, Guido Propositional interval neighborhood logics: expressiveness, decidability, and undecidable extensions. (English) Zbl 1221.03022 Ann. Pure Appl. Logic 161, No. 3, 289-304 (2009). MSC: 03B70 03B25 03B44 PDFBibTeX XMLCite \textit{D. Bresolin} et al., Ann. Pure Appl. Logic 161, No. 3, 289--304 (2009; Zbl 1221.03022) Full Text: DOI
Figueira, Santiago; Nies, André; Stephan, Frank Lowness properties and approximations of the jump. (English) Zbl 1137.03025 Ann. Pure Appl. Logic 152, No. 1-3, 51-66 (2008). Reviewer: Cristian S. Calude (Auckland) MSC: 03D25 03D35 68Q30 PDFBibTeX XMLCite \textit{S. Figueira} et al., Ann. Pure Appl. Logic 152, No. 1--3, 51--66 (2008; Zbl 1137.03025) Full Text: DOI
Shlapentokh, Alexandra First-order definitions of rational functions and \({\mathcal S}\)-integers over holomorphy rings of algebraic functions of characteristic 0. (English) Zbl 1079.03025 Ann. Pure Appl. Logic 136, No. 3, 267-283 (2005). MSC: 03C60 03C40 03B25 PDFBibTeX XMLCite \textit{A. Shlapentokh}, Ann. Pure Appl. Logic 136, No. 3, 267--283 (2005; Zbl 1079.03025) Full Text: DOI
Grzegorczyk, Andrzej Decidability without mathematics. (English) Zbl 1056.03023 Ann. Pure Appl. Logic 126, No. 1-3, 309-312 (2004). Reviewer: Vesa Halava (Turku) MSC: 03D75 03D20 03D35 PDFBibTeX XMLCite \textit{A. Grzegorczyk}, Ann. Pure Appl. Logic 126, No. 1--3, 309--312 (2004; Zbl 1056.03023) Full Text: DOI
Wells, Benjamin Applying, extending, and specializing pseudorecursiveness. (English) Zbl 1047.03033 Ann. Pure Appl. Logic 126, No. 1-3, 225-254 (2004); erratum ibid. 128, No. 1-3, 299 (2004). MSC: 03D35 03C05 03B25 03D15 PDFBibTeX XMLCite \textit{B. Wells}, Ann. Pure Appl. Logic 126, No. 1--3, 225--254 (2004; Zbl 1047.03033) Full Text: DOI
Marcinkowski, Jerzy; Pacholski, Leszek Thue trees. (English) Zbl 1020.03039 Ann. Pure Appl. Logic 119, No. 1-3, 19-59 (2003). Reviewer: U.Schöning (Ulm) MSC: 03D35 03D03 68Q42 68Q17 68P15 03B35 PDFBibTeX XMLCite \textit{J. Marcinkowski} and \textit{L. Pacholski}, Ann. Pure Appl. Logic 119, No. 1--3, 19--59 (2003; Zbl 1020.03039) Full Text: DOI
Vsemirnov, Maxim The Woods-Erdős conjecture for polynomial rings. (English) Zbl 0999.12015 Ann. Pure Appl. Logic 113, No. 1-3, 331-344 (2002). Reviewer: G.Pestov (Tomsk) MSC: 12L05 12E05 03B25 PDFBibTeX XMLCite \textit{M. Vsemirnov}, Ann. Pure Appl. Logic 113, No. 1--3, 331--344 (2002; Zbl 0999.12015) Full Text: DOI
Mundici, Daniele; Panti, Giovanni Decidable and undecidable prime theories in infinite-valued logic. (English) Zbl 1130.03019 Ann. Pure Appl. Logic 108, No. 1-3, 269-278 (2001). MSC: 03B50 03B25 03D35 06D35 06F20 PDFBibTeX XMLCite \textit{D. Mundici} and \textit{G. Panti}, Ann. Pure Appl. Logic 108, No. 1--3, 269--278 (2001; Zbl 1130.03019) Full Text: DOI
Hodkinson, Ian; Wolter, Frank; Zakharyaschev, Michael Decidable fragments of first-order temporal logics. (English) Zbl 0999.03015 Ann. Pure Appl. Logic 106, No. 1-3, 85-134 (2000). Reviewer: Martin Hofmann (München) MSC: 03B44 03B25 68P15 68Q60 68T30 03D35 PDFBibTeX XMLCite \textit{I. Hodkinson} et al., Ann. Pure Appl. Logic 106, No. 1--3, 85--134 (2000; Zbl 0999.03015) Full Text: DOI
Ambos-Spies, Klaus; Hirschfeldt, Denis R.; Shore, Richard A. Undecidability and 1-types in intervals of the computably enumerable degrees. (English) Zbl 0971.03040 Ann. Pure Appl. Logic 106, No. 1-3, 1-47 (2000). Reviewer: Andrei S.Morozov (Novosibirsk) MSC: 03D25 03D35 PDFBibTeX XMLCite \textit{K. Ambos-Spies} et al., Ann. Pure Appl. Logic 106, No. 1--3, 1--47 (2000; Zbl 0971.03040) Full Text: DOI
Herrmann, E. Boolean pairs formed by the \(\Delta_ n^ 0\)-sets. (English) Zbl 0878.03033 Ann. Pure Appl. Logic 87, No. 2, 145-149 (1997). MSC: 03D35 PDFBibTeX XMLCite \textit{E. Herrmann}, Ann. Pure Appl. Logic 87, No. 2, 145--149 (1997; Zbl 0878.03033) Full Text: DOI
Kanovich, Max I. Linear logic as a logic of computations. (English) Zbl 0804.03004 Ann. Pure Appl. Logic 67, No. 1-3, 183-212 (1994). Reviewer: H.C.M.de Swart (Tilburg) MSC: 03B20 03D05 03D35 68Q05 PDFBibTeX XMLCite \textit{M. I. Kanovich}, Ann. Pure Appl. Logic 67, No. 1--3, 183--212 (1994; Zbl 0804.03004) Full Text: DOI
Marcja, Annalisa; Prest, Mike; Toffalori, Carlo On the undecidability of some classes of abelian-by-finite groups. (English) Zbl 0784.03011 Ann. Pure Appl. Logic 62, No. 2, 167-173 (1993). Reviewer: S.R.Kogalovskij (Ivanovo) MSC: 03B25 20F10 20F18 PDFBibTeX XMLCite \textit{A. Marcja} et al., Ann. Pure Appl. Logic 62, No. 2, 167--173 (1993; Zbl 0784.03011) Full Text: DOI
Ambos-Spies, Klaus; Shore, Richard A. Undecidability and 1-types in the recursively enumerable degrees. (English) Zbl 0788.03062 Ann. Pure Appl. Logic 63, No. 1, 3-37 (1993). Reviewer: R.Downey (Wellington) MSC: 03D35 03D25 PDFBibTeX XMLCite \textit{K. Ambos-Spies} and \textit{R. A. Shore}, Ann. Pure Appl. Logic 63, No. 1, 3--37 (1993; Zbl 0788.03062) Full Text: DOI
Downey, Rod Every recursive Boolean algebra is isomorphic to one with incomplete atoms. (English) Zbl 0796.03049 Ann. Pure Appl. Logic 60, No. 3, 193-206 (1993). Reviewer: M.Zimand (Rochester) MSC: 03D45 03D35 PDFBibTeX XMLCite \textit{R. Downey}, Ann. Pure Appl. Logic 60, No. 3, 193--206 (1993; Zbl 0796.03049) Full Text: DOI
Kummer, Martin; Stephan, Frank Weakly semirecursive sets and r.e. orderings. (English) Zbl 0767.03023 Ann. Pure Appl. Logic 60, No. 2, 133-150 (1993). Reviewer: C.Calude (Auckland) MSC: 03D25 03D30 03D35 PDFBibTeX XMLCite \textit{M. Kummer} and \textit{F. Stephan}, Ann. Pure Appl. Logic 60, No. 2, 133--150 (1993; Zbl 0767.03023) Full Text: DOI
Cenzer, Douglas; Downey, Rodney; Jockusch, Carl; Shore, Richard A. Countable thin \(\Pi^0_1\) classes. (English) Zbl 0909.03039 Ann. Pure Appl. Logic 59, No. 2, 79-139 (1993). Reviewer: Marius Zimand (MR 93m:03075) MSC: 03D30 03D25 03D45 PDFBibTeX XMLCite \textit{D. Cenzer} et al., Ann. Pure Appl. Logic 59, No. 2, 79--139 (1993; Zbl 0909.03039) Full Text: DOI
Lincoln, Patrick; Mitchell, John; Scedrov, Andre; Shankar, Natarajan Decision problems for propositional linear logic. (English) Zbl 0768.03003 Ann. Pure Appl. Logic 56, No. 1-3, 239-311 (1992). Reviewer: A.Ursini (Siena) MSC: 03B20 03D35 03D15 03B25 68Q25 03F05 PDFBibTeX XMLCite \textit{P. Lincoln} et al., Ann. Pure Appl. Logic 56, No. 1--3, 239--311 (1992; Zbl 0768.03003) Full Text: DOI
Marek, W.; Nerode, A.; Remmel, J. How complicated is the set of stable models of a recursive logic program? (English) Zbl 0766.03024 Ann. Pure Appl. Logic 56, No. 1-3, 119-135 (1992). Reviewer: U.Schöning (Ulm) MSC: 03D35 68N17 03C50 PDFBibTeX XMLCite \textit{W. Marek} et al., Ann. Pure Appl. Logic 56, No. 1--3, 119--135 (1992; Zbl 0766.03024) Full Text: DOI
Seese, D. The structure of the models of decidable monadic theories of graphs. (English) Zbl 0733.03026 Ann. Pure Appl. Logic 53, No. 2, 169-195 (1991). Reviewer: J.M.Plotkin (East Lansing) MSC: 03C65 03B25 05C99 05C05 05C10 PDFBibTeX XMLCite \textit{D. Seese}, Ann. Pure Appl. Logic 53, No. 2, 169--195 (1991; Zbl 0733.03026) Full Text: DOI
Migador, Menachem; Rosenthal, John W.; Rubin, Matatyahu; Srour, Gabriel Some highly undecidable lattices. (English) Zbl 0693.03029 Ann. Pure Appl. Logic 46, No. 1, 41-63 (1990). Reviewer: L.Harkleroad MSC: 03D35 PDFBibTeX XMLCite \textit{M. Migador} et al., Ann. Pure Appl. Logic 46, No. 1, 41--63 (1990; Zbl 0693.03029) Full Text: DOI
Downey, R. G. Intervals and sublattices of the r.e. weak truth table degrees. I: Density. (English) Zbl 0628.03031 Ann. Pure Appl. Logic 41, No. 1, 1-26 (1989). MSC: 03D25 03D30 03D35 PDFBibTeX XMLCite \textit{R. G. Downey}, Ann. Pure Appl. Logic 41, No. 1, 1--26 (1989; Zbl 0628.03031) Full Text: DOI
Groszek, Marcia J. Applications of iterated perfect set forcing. (English) Zbl 0651.03039 Ann. Pure Appl. Logic 39, No. 1, 19-53 (1988). Reviewer: K.Gloede MSC: 03D35 03E50 PDFBibTeX XMLCite \textit{M. J. Groszek}, Ann. Pure Appl. Logic 39, No. 1, 19--53 (1988; Zbl 0651.03039) Full Text: DOI
Németi, I. On varieties of cylindric algebras with applications to logic. (English) Zbl 0637.03062 Ann. Pure Appl. Logic 36, 235-277 (1987). Reviewer: J.Monk MSC: 03G15 03D15 03B25 03D35 PDFBibTeX XMLCite \textit{I. Németi}, Ann. Pure Appl. Logic 36, 235--277 (1987; Zbl 0637.03062) Full Text: DOI
Silibovsky Brady, Sheryl; Remmel, Jeffrey B. The undecidability of the lattice of r. e. closed subsets of an effective topological space. (English) Zbl 0637.03041 Ann. Pure Appl. Logic 35, 193-203 (1987). Reviewer: M.Zimand MSC: 03D45 03D35 PDFBibTeX XMLCite \textit{S. Silibovsky Brady} and \textit{J. B. Remmel}, Ann. Pure Appl. Logic 35, 193--203 (1987; Zbl 0637.03041) Full Text: DOI
Compton, Kevin J.; Henson, C. Ward; Shelah, Saharon Nonconvergence, undecidability, and intractability in asymptotic problems. (English) Zbl 0632.03037 Ann. Pure Appl. Logic 36, 207-224 (1987). MSC: 03D35 03D15 05A99 PDFBibTeX XMLCite \textit{K. J. Compton} et al., Ann. Pure Appl. Logic 36, 207--224 (1987; Zbl 0632.03037) Full Text: DOI Link
Cenzer, Douglas; Clote, Peter; Smith, Rick L.; Soare, Robert I.; Wainer, Stanley S. Members of countable \(\Pi ^ 0_ 1\) classes. (English) Zbl 0605.03020 Ann. Pure Appl. Logic 31, 145-163 (1986). MSC: 03D55 03D30 03E10 03D35 PDFBibTeX XMLCite \textit{D. Cenzer} et al., Ann. Pure Appl. Logic 31, 145--163 (1986; Zbl 0605.03020) Full Text: DOI
Cherlin, Gregory; Jarden, Moshe Undecidability of some elementary theories over PAC fields. (English) Zbl 0591.03021 Ann. Pure Appl. Logic 30, 137-163 (1986). MSC: 03D35 12L05 PDFBibTeX XMLCite \textit{G. Cherlin} and \textit{M. Jarden}, Ann. Pure Appl. Logic 30, 137--163 (1986; Zbl 0591.03021) Full Text: DOI