Jordon, Liam; Maguire, Phil; Moser, Philippe Pebble-depth. (English) Zbl 07898950 Theor. Comput. Sci. 1009, Article ID 114638, 22 p. (2024). MSC: 68Qxx × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Bienvenu, Laurent; Delle Rose, Valentino; Merkle, Wolfgang Relativized depth. (English) Zbl 1523.03018 Theor. Comput. Sci. 949, Article ID 113694, 15 p. (2023). Reviewer: Rupert Hölzl (Neubiberg) MSC: 03D32 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Barmpalias, George; Shen, Alexander The Kučera-Gács theorem revisited by Levin. (English) Zbl 07648692 Theor. Comput. Sci. 947, Article ID 113693, 10 p. (2023). MSC: 03D32 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Misselbeck-Wessel, Daniel; Schuster, Peter Radical theory of Scott-open filters. (English) Zbl 07648673 Theor. Comput. Sci. 945, Article ID 113677, 19 p. (2023). MSC: 03-XX 06-XX × Cite Format Result Cite Review PDF Full Text: DOI
Selivanov, Victor Descriptive complexity of \(\mathsf{qc} \mathsf{b}_0\)-spaces. (English) Zbl 07648670 Theor. Comput. Sci. 945, Article ID 113666, 43 p. (2023). MSC: 03E15 × Cite Format Result Cite Review PDF Full Text: DOI
Hetzl, Stefan; Vierling, Jannik Unprovability results for clause set cycles. (English) Zbl 1540.03024 Theor. Comput. Sci. 935, 21-46 (2022). MSC: 03B35 03F30 × Cite Format Result Cite Review PDF Full Text: DOI arXiv OA License
Bridges, Douglas S. Morse set theory as a foundation for constructive mathematics. (English) Zbl 07597581 Theor. Comput. Sci. 928, 115-135 (2022). MSC: 03F65 × Cite Format Result Cite Review PDF Full Text: DOI
Nies, André; Stephan, Frank Randomness and initial segment complexity for measures. (English) Zbl 1518.68147 Theor. Comput. Sci. 900, 1-19 (2022). Reviewer: Liang Yu (Nanjing) MSC: 68Q30 03D32 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Calude, Cristian S.; Celine, Karen Frilya; Gao, Ziyuan; Jain, Sanjay; Staiger, Ludwig; Stephan, Frank Bi-immunity over different size alphabets. (English) Zbl 1514.68087 Theor. Comput. Sci. 894, 31-49 (2021). MSC: 68Q30 03D32 × Cite Format Result Cite Review PDF Full Text: DOI
Sureson, Claude Subcomputable Hausdorff function dimension. (English) Zbl 1518.03010 Theor. Comput. Sci. 891, 59-83 (2021). Reviewer: Liang Yu (Nanjing) MSC: 03D32 03D80 28A78 68Q30 × Cite Format Result Cite Review PDF Full Text: DOI
Bhojraj, Tejas Prefix-free quantum Kolmogorov complexity. (English) Zbl 1504.68084 Theor. Comput. Sci. 875, 65-80 (2021). MSC: 68Q30 68Q04 68Q12 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Chiari, Michele; Mandrioli, Dino; Pradella, Matteo Operator precedence temporal logic and model checking. (English) Zbl 1464.68197 Theor. Comput. Sci. 848, 47-81 (2020). MSC: 68Q60 03B44 68Q45 × Cite Format Result Cite Review PDF Full Text: DOI Link
Belot, Gordon Absolutely no free lunches! (English) Zbl 1454.68117 Theor. Comput. Sci. 845, 159-180 (2020). MSC: 68T05 68T20 90C59 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Kawai, Tatsuji Presenting de Groot duality of stably compact spaces. (English) Zbl 1461.06003 Theor. Comput. Sci. 823, 44-68 (2020). Reviewer: Xiaoquan Xu (Zhangzhou) MSC: 06D22 06B35 54B30 54D45 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Wang, Longchun; Li, Qingguo A logic for Lawson compact algebraic L-domains. (English) Zbl 1481.03012 Theor. Comput. Sci. 813, 410-427 (2020). MSC: 03B70 06B35 × Cite Format Result Cite Review PDF Full Text: DOI
Calude, Cristian S.; Jain, Sanjay; Merkle, Wolfgang; Stephan, Frank Searching for shortest and least programs. (English) Zbl 1443.68074 Theor. Comput. Sci. 807, 114-127 (2020). Reviewer: Liang Yu (Nanjing) MSC: 68Q30 03D10 × Cite Format Result Cite Review PDF Full Text: DOI
Wang, Hui; Elzinga, Cees H.; Lin, Zhiwei; Vincent, Jordan Quantifying sequential subsumption. (English) Zbl 1435.68324 Theor. Comput. Sci. 793, 79-99 (2019). Reviewer: Ion Iancu (Craiova) MSC: 68T30 68T09 68T10 × Cite Format Result Cite Review PDF Full Text: DOI Link
Cintula, Petr; Diaconescu, Denisa; Metcalfe, George Skolemization and Herbrand theorems for lattice-valued logics. (English) Zbl 1472.03022 Theor. Comput. Sci. 768, 54-75 (2019). MSC: 03B50 × Cite Format Result Cite Review PDF Full Text: DOI Link
Moggi, Eugenio; Farjudian, Amin; Duracz, Adam; Taha, Walid Safe & robust reachability analysis of hybrid systems. (English) Zbl 1400.68140 Theor. Comput. Sci. 747, 75-99 (2018). MSC: 68Q85 06B35 18B20 93B25 × Cite Format Result Cite Review PDF Full Text: DOI arXiv OA License
Guzmán, Michell; Perchy, Salim; Rueda, Camilo; Valencia, Frank D. Characterizing right inverses for spatial constraint systems with applications to modal logic. (English) Zbl 1400.68134 Theor. Comput. Sci. 744, 56-77 (2018). MSC: 68Q85 03B45 × Cite Format Result Cite Review PDF Full Text: DOI HAL
Case, Adam; Lutz, Jack H. Mutual dimension and random sequences. (English) Zbl 1398.68263 Theor. Comput. Sci. 731, 68-87 (2018). Reviewer: Cristian S. Calude (Auckland) MSC: 68Q30 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Case, John; Jain, Sanjay; Stephan, Frank Effectivity questions for Kleene’s recursion theorem. (English) Zbl 1393.68086 Theor. Comput. Sci. 733, 55-70 (2018). MSC: 68Q32 03D20 68Q30 × Cite Format Result Cite Review PDF Full Text: DOI
Leike, Jan; Hutter, Marcus On the computability of Solomonoff induction and AIXI. (English) Zbl 1388.68253 Theor. Comput. Sci. 716, 28-49 (2018). MSC: 68T05 03D15 68Q30 × Cite Format Result Cite Review PDF Full Text: DOI Link
Downey, Rod; McInerney, Michael; Ng, Keng Meng Lowness and logical depth. (English) Zbl 1418.03150 Theor. Comput. Sci. 702, 23-33 (2017). MSC: 03D32 03D25 × Cite Format Result Cite Review PDF Full Text: DOI
Barmpalias, George; Downey, Rodney G. Kobayashi compressibility. (English) Zbl 1369.68249 Theor. Comput. Sci. 675, 89-100 (2017). MSC: 68Q30 03D32 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Barmpalias, George; Cenzer, Douglas; Porter, Christopher P. Random numbers as probabilities of machine behavior. (English) Zbl 1370.03061 Theor. Comput. Sci. 673, 1-18 (2017). MSC: 03D32 03D10 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Sureson, Claude \({\Pi}_1^1\)-Martin-Löf random reals as measures of natural open sets. (English) Zbl 1402.03063 Theor. Comput. Sci. 653, 26-41 (2016). MSC: 03D32 03E15 × Cite Format Result Cite Review PDF Full Text: DOI
Rute, Jason When does randomness come from randomness? (English) Zbl 1339.68127 Theor. Comput. Sci. 635, 35-50 (2016). MSC: 68Q30 03D32 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Haniková, Zuzana; Savický, Petr Term satisfiability in \(\mathrm{FL}_{\mathrm{ew}}\)-algebras. (English) Zbl 1418.03193 Theor. Comput. Sci. 631, 1-15 (2016). MSC: 03G25 03B47 68Q25 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Xu, Zhaowei; Sui, Yuefei; Zhang, Wenhui Completeness of Hoare logic with inputs over the standard model. (English) Zbl 1333.68182 Theor. Comput. Sci. 612, 23-28 (2016). MSC: 68Q60 03B70 03F30 × Cite Format Result Cite Review PDF Full Text: DOI
Jacobs, Bart Dijkstra and Hoare monads in monadic computation. (English) Zbl 1330.68047 Theor. Comput. Sci. 604, 30-45 (2015). MSC: 68N30 18C15 68Q55 × Cite Format Result Cite Review PDF Full Text: DOI
Caleiro, Carlos; Marcos, João; Volpe, Marco Bivalent semantics, generalized compositionality and analytic classic-like tableaux for finite-valued logics. (English) Zbl 1331.03024 Theor. Comput. Sci. 603, 84-110 (2015). MSC: 03B50 03B35 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
French, Tim; McCabe-Dansted, John; Reynolds, Mark Synthesis for continuous time. (English) Zbl 1328.68126 Theor. Comput. Sci. 594, 201-222 (2015). MSC: 68Q60 03B44 × Cite Format Result Cite Review PDF Full Text: DOI
Sureson, Claude Random reals as measures of natural open sets. (English) Zbl 1327.03035 Theor. Comput. Sci. 589, 1-23 (2015). Reviewer: Ludwig Staiger (Halle/Saale) MSC: 03D32 68Q30 × Cite Format Result Cite Review PDF Full Text: DOI
Salo, Ville; Törmä, Ilkka Category theory of symbolic dynamics. (English) Zbl 1314.37011 Theor. Comput. Sci. 567, 21-45 (2015). MSC: 37B10 18B20 68Q45 × Cite Format Result Cite Review PDF Full Text: DOI arXiv Backlinks: MO
Montanari, Ugo; Sammartino, Matteo A network-conscious \(\pi\)-calculus and its coalgebraic semantics. (English) Zbl 1342.68234 Theor. Comput. Sci. 546, 188-224 (2014). MSC: 68Q85 68Q55 × Cite Format Result Cite Review PDF Full Text: DOI
Bucalo, Anna; Rosolini, Giuseppe Sobriety for equilogical spaces. (English) Zbl 1420.18006 Theor. Comput. Sci. 546, 93-98 (2014). MSC: 18B30 06D22 18D15 18E10 × Cite Format Result Cite Review PDF Full Text: DOI
Tremblay, Hugo; Labelle, Gilbert; Brlek, Srečko; Blondin Massé, Alexandre Exhaustive generation of atomic combinatorial differential operators. (English) Zbl 1358.05017 Theor. Comput. Sci. 536, 62-69 (2014). MSC: 05A15 05E15 × Cite Format Result Cite Review PDF Full Text: DOI
D’Agostino, Marcello; Finger, Marcelo; Gabbay, Dov Semantics and proof-theory of depth bounded Boolean logics. (English) Zbl 1315.03107 Theor. Comput. Sci. 480, 43-68 (2013). MSC: 03F03 03B05 03B35 × Cite Format Result Cite Review PDF Full Text: DOI Link
Downey, Rod; Ng, Keng Meng Lowness for bounded randomness. (English) Zbl 1283.68173 Theor. Comput. Sci. 460, 1-9 (2012). MSC: 68Q30 03D32 × Cite Format Result Cite Review PDF Full Text: DOI
Bienvenu, Laurent; Porter, Christopher Strong reductions in effective randomness. (English) Zbl 1283.68170 Theor. Comput. Sci. 459, 55-68 (2012). MSC: 68Q30 03D32 × Cite Format Result Cite Review PDF Full Text: DOI
Day, Adam R. Process and truth-table characterisations of randomness. (English) Zbl 1247.68115 Theor. Comput. Sci. 452, 47-55 (2012). MSC: 68Q30 × Cite Format Result Cite Review PDF Full Text: DOI
Conidis, Chris J. Effectively approximating measurable sets by open sets. (English) Zbl 1250.03070 Theor. Comput. Sci. 428, 36-46 (2012). MSC: 03D45 03D32 28E15 68Q30 × Cite Format Result Cite Review PDF Full Text: DOI
Barmpalias, George; Sterkenburg, T. F. On the number of infinite sequences with trivial initial segment complexity. (English) Zbl 1235.68086 Theor. Comput. Sci. 412, No. 52, 7133-7146 (2011). MSC: 68Q30 68Q15 × Cite Format Result Cite Review PDF Full Text: DOI
Skowron, Andrzej; Wasilewski, Piotr Information systems in modeling interactive computations on granules. (English) Zbl 1223.68118 Theor. Comput. Sci. 412, No. 42, 5939-5959 (2011). MSC: 68U35 68T37 × Cite Format Result Cite Review PDF Full Text: DOI
Calude, Cristian S.; Salomaa, Kai; Roblot, Tania K. Finite state complexity. (English) Zbl 1235.68088 Theor. Comput. Sci. 412, No. 41, 5668-5677 (2011). MSC: 68Q30 68Q15 × Cite Format Result Cite Review PDF Full Text: DOI
Barmpalias, George; Vlek, C. S. Kolmogorov complexity of initial segments of sequences and arithmetical definability. (English) Zbl 1235.68087 Theor. Comput. Sci. 412, No. 41, 5656-5667 (2011). MSC: 68Q30 × Cite Format Result Cite Review PDF Full Text: DOI
Capretta, Venanzio Coalgebras in functional programming and type theory. (English) Zbl 1225.68057 Theor. Comput. Sci. 412, No. 38, 5006-5024 (2011). MSC: 68N18 03B70 68Q65 × Cite Format Result Cite Review PDF Full Text: DOI
Horčík, Rostislav; Terui, Kazushige Disjunction property and complexity of substructural logics. (English) Zbl 1231.03021 Theor. Comput. Sci. 412, No. 31, 3992-4006 (2011). MSC: 03B47 03D15 68Q17 × Cite Format Result Cite Review PDF Full Text: DOI
Calude, Cristian S.; Nies, André; Staiger, Ludwig; Stephan, Frank Universal recursively enumerable sets of strings. (English) Zbl 1217.68115 Theor. Comput. Sci. 412, No. 22, 2253-2261 (2011). Reviewer: Liang Yu (Nanjing) MSC: 68Q30 03D25 × Cite Format Result Cite Review PDF Full Text: DOI
Calude, Cristian S. Simplicity via provability for universal prefix-free Turing machines. (English) Zbl 1207.68136 Theor. Comput. Sci. 412, No. 1-2, 178-182 (2011). MSC: 68Q05 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Rybakov, Vladimir Rules admissible in transitive temporal logic \(\mathrm{T}_{\mathrm{S}4}\), sufficient condition. (English) Zbl 1209.03011 Theor. Comput. Sci. 411, No. 50, 4323-4332 (2010). MSC: 03B44 × Cite Format Result Cite Review PDF Full Text: DOI
Rabinovich, Alexander Complexity of metric temporal logics with counting and the Pnueli modalities. (English) Zbl 1196.03029 Theor. Comput. Sci. 411, No. 22-24, 2331-2342 (2010). Reviewer: Clemens Kupke (London) MSC: 03B44 68Q25 × Cite Format Result Cite Review PDF Full Text: DOI
Kastermans, Bart; Lempp, Steffen Comparing notions of randomness. (English) Zbl 1184.68274 Theor. Comput. Sci. 411, No. 3, 602-616 (2010). MSC: 68Q30 × Cite Format Result Cite Review PDF Full Text: DOI
Avellone, Alessandro; Fiorino, Guido; Moscato, Ugo Optimization techniques for propositional intuitionistic logic and their implementation. (English) Zbl 1157.68060 Theor. Comput. Sci. 409, No. 1, 41-58 (2008). MSC: 68T15 03B20 03B35 × Cite Format Result Cite Review PDF Full Text: DOI
Rabinovich, Alexander Arity hierarchy for temporal logics. (English) Zbl 1151.03010 Theor. Comput. Sci. 403, No. 2-3, 373-381 (2008). Reviewer: Valentin F. Goranko (Johannesburg) MSC: 03B44 03B70 × Cite Format Result Cite Review PDF Full Text: DOI
Avron, Arnon Constructibility and decidability versus domain independence and absoluteness. (English) Zbl 1134.03025 Theor. Comput. Sci. 394, No. 3, 144-158 (2008). MSC: 03D45 03B25 03E45 68P15 × Cite Format Result Cite Review PDF Full Text: DOI
d’Avila Garcez, Artur S.; Lamb, Luís C.; Gabbay, Dov M. Connectionist modal logic: representing modalities in neural networks. (English) Zbl 1108.68103 Theor. Comput. Sci. 371, No. 1-2, 34-53 (2007). MSC: 68T05 03B45 68T30 68Q10 68T27 × Cite Format Result Cite Review PDF Full Text: DOI Link
Adámek, J. The intersection of algebra and coalgebra. (English) Zbl 1110.18002 Theor. Comput. Sci. 366, No. 1-2, 82-97 (2006). Reviewer: Dana Piciu (Craiova) MSC: 18C05 18B20 08B99 18C20 68Q99 × Cite Format Result Cite Review PDF Full Text: DOI
Hartmann, Sven; Link, Sebastian Deciding implication for functional dependencies in complex-value databases. (English) Zbl 1110.68034 Theor. Comput. Sci. 364, No. 2, 212-240 (2006). MSC: 68P15 × Cite Format Result Cite Review PDF Full Text: DOI
Demri, Stéphane LTL over integer periodicity constraints. (English) Zbl 1097.68073 Theor. Comput. Sci. 360, No. 1-3, 96-123 (2006). MSC: 68Q60 03B44 03D05 68Q17 × Cite Format Result Cite Review PDF Full Text: DOI HAL
d’Avila Garcez, Artur S.; Lamb, Luís C.; Gabbay, Dov M. Connectionist computations of intuitionistic reasoning. (English) Zbl 1097.68119 Theor. Comput. Sci. 358, No. 1, 34-55 (2006). MSC: 68T05 68Q05 68T27 × Cite Format Result Cite Review PDF Full Text: DOI
Hella, Lauri; Turull-Torres, José María Computing queries with higher-order logics. (English) Zbl 1088.68047 Theor. Comput. Sci. 355, No. 2, 197-214 (2006). MSC: 68P15 68Q19 03B15 × Cite Format Result Cite Review PDF Full Text: DOI
Bournez, Olivier; Hainry, Emmanuel Elementarily computable functions over the real numbers and \(\mathbb R\)-sub-recursive functions. (English) Zbl 1087.03025 Theor. Comput. Sci. 348, No. 2-3, 130-147 (2005). Reviewer: Tao Renji (Beijing) MSC: 03D20 03F60 × Cite Format Result Cite Review PDF Full Text: DOI
Palmigiano, Alessandra A coalgebraic view on positive modal logic. (English) Zbl 1068.03017 Theor. Comput. Sci. 327, No. 1-2, 175-195 (2004). Reviewer: Jesús Medina Moreno (Malaga) MSC: 03B45 03B70 03G30 × Cite Format Result Cite Review PDF Full Text: DOI
Kristiansen, L.; Niggl, K.-H. On the computational complexity of imperative programming languages. (English) Zbl 1048.03030 Theor. Comput. Sci. 318, No. 1-2, 139-161 (2004). MSC: 03D10 03D15 03D20 68Q15 68N15 × Cite Format Result Cite Review PDF Full Text: DOI
Pym, David J.; O’Hearn, Peter W.; Yang, Hongseok Possible worlds and resources: The semantics of \(\mathbf{BI}\). (English) Zbl 1055.03021 Theor. Comput. Sci. 315, No. 1, 257-305 (2004). MSC: 03B70 03F52 03G30 03B47 68Q85 × Cite Format Result Cite Review PDF Full Text: DOI
Campagnolo, Manuel Lameiras Continuous-time computation with restricted integration capabilities. (English) Zbl 1052.03019 Theor. Comput. Sci. 317, No. 1-3, 147-165 (2004). Reviewer: R. Downey (Wellington) MSC: 03D65 03D15 68Q15 × Cite Format Result Cite Review PDF Full Text: DOI
Vickers, S. J.; Townsend, C. F. A universal characterization of the double powerlocale. (English) Zbl 1047.06006 Theor. Comput. Sci. 316, No. 1-3, 297-321 (2004). MSC: 06D22 54B20 54C35 54B30 03F55 06B35 18F20 18B25 × Cite Format Result Cite Review PDF Full Text: DOI Link
Vickers, Steven Entailment systems for stably locally compact locales. (English) Zbl 1047.06007 Theor. Comput. Sci. 316, No. 1-3, 259-296 (2004). MSC: 06D22 54D45 03F55 03B70 54B30 × Cite Format Result Cite Review PDF Full Text: DOI Link
Townsend, C. F. Presenting locale pullback via directed complete posets. (English) Zbl 1048.18003 Theor. Comput. Sci. 316, No. 1-3, 225-258 (2004). Reviewer: Peter T. Johnstone (Cambridge) MSC: 18B25 06B35 06D22 18A30 18D20 54D10 × Cite Format Result Cite Review PDF Full Text: DOI
Forster, Thomas Better-quasi-orderings and coinduction. (English) Zbl 1081.06002 Theor. Comput. Sci. 309, No. 1-3, 111-123 (2003). MSC: 06A06 06B35 68Q65 × Cite Format Result Cite Review PDF Full Text: DOI
Vîţă, L. S.; Bridges, D. S. A constructive theory of point-set nearness. (English) Zbl 1052.54023 Theor. Comput. Sci. 305, No. 1-3, 473-489 (2003). Reviewer: Ákos Császár (Budapest) MSC: 54E17 54E05 03F60 × Cite Format Result Cite Review PDF Full Text: DOI
Maksimova, L. Complexity of some problems in positive and related calculi. (English) Zbl 1020.03005 Theor. Comput. Sci. 303, No. 1, 171-185 (2003). MSC: 03B20 03D15 03C40 03B25 68Q17 × Cite Format Result Cite Review PDF Full Text: DOI
Santocanale, Luigi On the equational definition of the least prefixed point. (English) Zbl 1045.68088 Theor. Comput. Sci. 295, No. 1-3, 341-370 (2003). MSC: 68Q55 × Cite Format Result Cite Review PDF Full Text: DOI
Zhu, Zhaohui; Li, Bin; Xiao, Xi’an; Chen, Shifu; Zhu, Wujia A representation theorem for recovering contraction relations satisfying wci. (English) Zbl 1019.68106 Theor. Comput. Sci. 290, No. 1, 545-564 (2003). MSC: 68T30 68T27 × Cite Format Result Cite Review PDF Full Text: DOI
Beckmann, Arnold Notations for exponentiation. (English) Zbl 1061.03062 Theor. Comput. Sci. 288, No. 1, 3-19 (2002). MSC: 03F25 03D15 03F30 68Q19 × Cite Format Result Cite Review PDF Full Text: DOI
Clavel, Manuel; Meseguer, José Reflection in conditional rewriting logic. (English) Zbl 1001.68060 Theor. Comput. Sci. 285, No. 2, 245-288 (2002). MSC: 68Q42 68T27 × Cite Format Result Cite Review PDF Full Text: DOI
Joly, T. Constant time parallel computations in \(\lambda\)-calculus. (English) Zbl 0989.68018 Theor. Comput. Sci. 266, No. 1-2, 975-985 (2001). MSC: 68N18 × Cite Format Result Cite Review PDF Full Text: DOI
Lepper, Ingo Derivation lengths and order types of Knuth–Bendix orders. (English) Zbl 0983.68087 Theor. Comput. Sci. 269, No. 1-2, 433-450 (2001). MSC: 68Q42 × Cite Format Result Cite Review PDF Full Text: DOI
Sudac, O. The prime number theorem is PRA-provable. (English) Zbl 0974.03048 Theor. Comput. Sci. 257, No. 1-2, 185-239 (2001). MSC: 03F30 × Cite Format Result Cite Review PDF Full Text: DOI
Johnstone, P.; Power, J.; Tsujishita, T.; Watanabe, H.; Worrell, J. On the structure of categories of coalgebras. (English) Zbl 0973.68178 Theor. Comput. Sci. 260, No. 1-2, 87-117 (2001). MSC: 68Q85 × Cite Format Result Cite Review PDF Full Text: DOI
Caporaso, S.; Zito, M.; Galesi, N. A predicative and decidable characterization of the polynomial classes of languages. (English) Zbl 0952.68062 Theor. Comput. Sci. 250, No. 1-2, 83-99 (2001). MSC: 68Q15 68N18 × Cite Format Result Cite Review PDF Full Text: DOI
Rabinovich, Alexander Star free expressions over the reals. (English) Zbl 0953.68075 Theor. Comput. Sci. 233, No. 1-2, 233-245 (2000). MSC: 68Q45 03D05 × Cite Format Result Cite Review PDF Full Text: DOI
Galmiche, Didier; Pym, David J. Proof-search in type-theoretic languages: An introduction. (English) Zbl 0952.03006 Theor. Comput. Sci. 232, No. 1-2, 5-53 (2000). MSC: 03B35 03B15 03F03 68N18 03B70 × Cite Format Result Cite Review PDF Full Text: DOI
Leivant, D. D.; Marion, J.-Y. J.-Y. A characterization of alternating log time by ramified recurrence. (English) Zbl 0943.68080 Theor. Comput. Sci. 236, No. 1-2, 193-208 (2000). MSC: 68Q25 × Cite Format Result Cite Review PDF Full Text: DOI
Beklemishev, Lev D. Parameter free induction and provably total computable functions. (English) Zbl 0930.03082 Theor. Comput. Sci. 224, No. 1-2, 13-33 (1999). MSC: 03F30 03D20 03F45 03B70 × Cite Format Result Cite Review PDF Full Text: DOI
Kushner, Boris A. Markov’s constructive analysis; a participant’s view. (English) Zbl 0916.68053 Theor. Comput. Sci. 219, No. 1-2, 267-285 (1999). MSC: 68Q05 × Cite Format Result Cite Review PDF Full Text: DOI
Handley, W. G. Deterministic summation modulo \(\mathcal B_{n}\), the semigroup of binary relations on \(0,1, \dots, n-1\). (English) Zbl 0903.68002 Theor. Comput. Sci. 172, No. 1-2, 135-174 (1997). MSC: 68M07 × Cite Format Result Cite Review PDF Full Text: DOI
Clote, P. Nondeterministic stack register machines. (English) Zbl 0901.68052 Theor. Comput. Sci. 178, No. 1-2, 37-76 (1997). MSC: 68Q05 × Cite Format Result Cite Review PDF Full Text: DOI
Sureson, Claude P, NP, Co-NP and weak systems of arithmetic. (English) Zbl 0873.03038 Theor. Comput. Sci. 154, No. 2, 145-163 (1996). MSC: 03D15 03H15 68Q15 03F30 × Cite Format Result Cite Review PDF Full Text: DOI
Weiermann, Andreas Termination proofs for term rewriting systems by lexicographic path orderings imply multiply recursive derivation lengths. (English) Zbl 0874.68156 Theor. Comput. Sci. 139, No. 1-2, 355-362 (1995). MSC: 68Q42 × Cite Format Result Cite Review PDF Full Text: DOI
Hodkinson, Ian On Gabbay’s temporal fixed point operator. (English) Zbl 0874.68272 Theor. Comput. Sci. 139, No. 1-2, 1-25 (1995). MSC: 68T27 × Cite Format Result Cite Review PDF Full Text: DOI
Sureson, Claude \(\text{NP}\not={co}\)-NP and models of arithmetic. (English) Zbl 0873.68067 Theor. Comput. Sci. 147, No. 1-2, 55-67 (1995). MSC: 68Q15 × Cite Format Result Cite Review PDF Full Text: DOI
Crole, Roy L. Computational adequacy of the FIX-logic. (English) Zbl 0874.68267 Theor. Comput. Sci. 136, No. 1, 217-242 (1994). MSC: 68T27 × Cite Format Result Cite Review PDF Full Text: DOI
Coquand, Thierry Another proof of the intuitionistic Ramsey theorem. (English) Zbl 0801.03039 Theor. Comput. Sci. 115, No. 1, 63-75 (1993). Reviewer: W.Veldman (Nijmegen) MSC: 03F55 × Cite Format Result Cite Review PDF Full Text: DOI
Forster, Thomas A semantic characterization of the well-typed formulae of \(\lambda\)- calculus. (English) Zbl 0821.03007 Theor. Comput. Sci. 110, No. 2, 405-418 (1993). MSC: 03B40 68Q55 × Cite Format Result Cite Review PDF Full Text: DOI
Hofbauer, Dieter Termination proofs by multiset path orderings imply primitive recursive derivation lengths. (English) Zbl 0759.68045 Theor. Comput. Sci. 105, No. 1, 129-140 (1992). Reviewer: D.Hofbauer MSC: 68Q42 × Cite Format Result Cite Review PDF Full Text: DOI
Girard, Jean-Yves; Scedrov, Andre; Scott, Philip J. Bounded linear logic: A modular approach to polynomial-time computability. (English) Zbl 0788.03005 Theor. Comput. Sci. 97, No. 1, 1-66 (1992). Reviewer: C.Calude (Auckland) MSC: 03B20 03F03 03D15 68Q15 × Cite Format Result Cite Review PDF Full Text: DOI
Arikawa, Setsuo; Shinohara, Takeshi; Yamamoto, Akihiro Learning elementary formal systems. (English) Zbl 0746.68069 Theor. Comput. Sci. 95, No. 1, 97-113 (1992). MSC: 68T05 68N17 68Q45 × Cite Format Result Cite Review PDF Full Text: DOI