[https://portal.mardi4nfdi.de/wiki/Person:768101 Hartley jun. Rogers] table#1 { ["head"] = table#2 { ["vars"] = table#3 { "subjectLabel", "itemType", [0] = "subject", }, }, ["results"] = table#4 { ["bindings"] = table#5 { table#6 { ["itemType"] = table#7 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#8 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q818923", }, ["subjectLabel"] = table#9 { ["type"] = "literal", ["value"] = "The jump operation for structure degrees", ["xml:lang"] = "en", }, }, table#10 { ["itemType"] = table#11 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#12 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q818930", }, ["subjectLabel"] = table#13 { ["type"] = "literal", ["value"] = "The Hausdorff-Ershov hierarchy in Euclidean spaces", ["xml:lang"] = "en", }, }, table#14 { ["itemType"] = table#15 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#16 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q828116", }, ["subjectLabel"] = table#17 { ["type"] = "literal", ["value"] = "General recursive realizability and basic logic", ["xml:lang"] = "en", }, }, table#18 { ["itemType"] = table#19 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#20 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q833026", }, ["subjectLabel"] = table#21 { ["type"] = "literal", ["value"] = "Adaptive logics using the minimal abnormality strategy are \$\\Pi^1_1\$-complex", ["xml:lang"] = "en", }, }, table#22 { ["itemType"] = table#23 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#24 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q843607", }, ["subjectLabel"] = table#25 { ["type"] = "literal", ["value"] = "Fuzzy constructive logic", ["xml:lang"] = "en", }, }, table#26 { ["itemType"] = table#27 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#28 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q844884", }, ["subjectLabel"] = table#29 { ["type"] = "literal", ["value"] = "Algebraic simulations", ["xml:lang"] = "en", }, }, table#30 { ["itemType"] = table#31 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#32 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q850805", }, ["subjectLabel"] = table#33 { ["type"] = "literal", ["value"] = "Strong enumeration reducibilities", ["xml:lang"] = "en", }, }, table#34 { ["itemType"] = table#35 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#36 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q854185", }, ["subjectLabel"] = table#37 { ["type"] = "literal", ["value"] = "Towards a descriptive set theory for domain-like structures", ["xml:lang"] = "en", }, }, table#38 { ["itemType"] = table#39 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#40 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q855705", }, ["subjectLabel"] = table#41 { ["type"] = "literal", ["value"] = "Sublattice subgroups of finitely presented lattice-ordered groups.", ["xml:lang"] = "en", }, }, table#42 { ["itemType"] = table#43 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#44 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q859985", }, ["subjectLabel"] = table#45 { ["type"] = "literal", ["value"] = "Learning languages in a union", ["xml:lang"] = "en", }, }, table#46 { ["itemType"] = table#47 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#48 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q859986", }, ["subjectLabel"] = table#49 { ["type"] = "literal", ["value"] = "On the learnability of vector spaces", ["xml:lang"] = "en", }, }, table#50 { ["itemType"] = table#51 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#52 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q860823", }, ["subjectLabel"] = table#53 { ["type"] = "literal", ["value"] = "An approach to intrinsic complexity of uniform learning", ["xml:lang"] = "en", }, }, table#54 { ["itemType"] = table#55 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#56 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q860825", }, ["subjectLabel"] = table#57 { ["type"] = "literal", ["value"] = "From learning in the limit to stochastic finite learning", ["xml:lang"] = "en", }, }, table#58 { ["itemType"] = table#59 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#60 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q865654", }, ["subjectLabel"] = table#61 { ["type"] = "literal", ["value"] = "SAD as a mathematical assistant -- how should we go from here to there?", ["xml:lang"] = "en", }, }, table#62 { ["itemType"] = table#63 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#64 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q868025", }, ["subjectLabel"] = table#65 { ["type"] = "literal", ["value"] = "On the freeze quantifier in Constraint LTL: Decidability and complexity", ["xml:lang"] = "en", }, }, table#66 { ["itemType"] = table#67 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#68 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q870262", }, ["subjectLabel"] = table#69 { ["type"] = "literal", ["value"] = "A note on discreteness and virtuality in analog computing", ["xml:lang"] = "en", }, }, table#70 { ["itemType"] = table#71 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#72 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q881834", }, ["subjectLabel"] = table#73 { ["type"] = "literal", ["value"] = "Execution architectures for program algebra", ["xml:lang"] = "en", }, }, table#74 { ["itemType"] = table#75 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#76 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q885512", }, ["subjectLabel"] = table#77 { ["type"] = "literal", ["value"] = "Informal versus formal mathematics", ["xml:lang"] = "en", }, }, table#78 { ["itemType"] = table#79 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#80 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q887636", }, ["subjectLabel"] = table#81 { ["type"] = "literal", ["value"] = "The branching theorem and computable categoricity in the Ershov hierarchy", ["xml:lang"] = "en", }, }, table#82 { ["itemType"] = table#83 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#84 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q887638", }, ["subjectLabel"] = table#85 { ["type"] = "literal", ["value"] = "Index sets of constructive models of bounded signature that are autostable relative to strong constructivizations", ["xml:lang"] = "en", }, }, table#86 { ["itemType"] = table#87 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#88 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q892147", }, ["subjectLabel"] = table#89 { ["type"] = "literal", ["value"] = "Some properties of \$r\$-maximal sets and \$Q_{1,N}\$-reducibility", ["xml:lang"] = "en", }, }, table#90 { ["itemType"] = table#91 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#92 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q894253", }, ["subjectLabel"] = table#93 { ["type"] = "literal", ["value"] = "More on generic dimension groups", ["xml:lang"] = "en", }, }, table#94 { ["itemType"] = table#95 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#96 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q896903", }, ["subjectLabel"] = table#97 { ["type"] = "literal", ["value"] = "Theory of interaction", ["xml:lang"] = "en", }, }, table#98 { ["itemType"] = table#99 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#100 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q896915", }, ["subjectLabel"] = table#101 { ["type"] = "literal", ["value"] = "Completeness of Hoare logic with inputs over the standard model", ["xml:lang"] = "en", }, }, table#102 { ["itemType"] = table#103 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#104 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q897661", }, ["subjectLabel"] = table#105 { ["type"] = "literal", ["value"] = "Effective subsets under homeomorphisms of \$\\mathbb{R}^n\$", ["xml:lang"] = "en", }, }, table#106 { ["itemType"] = table#107 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#108 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q900476", }, ["subjectLabel"] = table#109 { ["type"] = "literal", ["value"] = "Superefficiency from the vantage point of computability", ["xml:lang"] = "en", }, }, table#110 { ["itemType"] = table#111 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#112 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q907196", }, ["subjectLabel"] = table#113 { ["type"] = "literal", ["value"] = "Taking the Pirahã seriously", ["xml:lang"] = "en", }, }, table#114 { ["itemType"] = table#115 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#116 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q909455", }, ["subjectLabel"] = table#117 { ["type"] = "literal", ["value"] = "Honest polynomial time reducibilities and the \$P=?NP\$ problem", ["xml:lang"] = "en", }, }, table#118 { ["itemType"] = table#119 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#120 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q909459", }, ["subjectLabel"] = table#121 { ["type"] = "literal", ["value"] = "A note on A.E. h-complex functions", ["xml:lang"] = "en", }, }, table#122 { ["itemType"] = table#123 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#124 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q910251", }, ["subjectLabel"] = table#125 { ["type"] = "literal", ["value"] = "Generalized closed world assumption is \$\\Pi ^ 0_ 2\$-complete", ["xml:lang"] = "en", }, }, table#126 { ["itemType"] = table#127 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#128 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q911584", }, ["subjectLabel"] = table#129 { ["type"] = "literal", ["value"] = "A categorial approach to the theory of computation", ["xml:lang"] = "en", }, }, table#130 { ["itemType"] = table#131 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#132 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q911585", }, ["subjectLabel"] = table#133 { ["type"] = "literal", ["value"] = "Proof-theoretical analysis: Weak systems of functions and classes", ["xml:lang"] = "en", }, }, table#134 { ["itemType"] = table#135 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#136 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q911776", }, ["subjectLabel"] = table#137 { ["type"] = "literal", ["value"] = "Some notes on Church's thesis and the theory of games", ["xml:lang"] = "en", }, }, table#138 { ["itemType"] = table#139 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#140 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q912587", }, ["subjectLabel"] = table#141 { ["type"] = "literal", ["value"] = "A category-theoretic characterization of functional completeness", ["xml:lang"] = "en", }, }, table#142 { ["itemType"] = table#143 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#144 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q688431", }, ["subjectLabel"] = table#145 { ["type"] = "literal", ["value"] = "Effective moduli from ineffective uniqueness proofs. An unwinding of de La Vallée Poussin's proof for Chebycheff approximation", ["xml:lang"] = "en", }, }, table#146 { ["itemType"] = table#147 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#148 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q688848", }, ["subjectLabel"] = table#149 { ["type"] = "literal", ["value"] = "The distribution of the generic recursively enumerable degrees", ["xml:lang"] = "en", }, }, table#150 { ["itemType"] = table#151 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#152 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q690175", }, ["subjectLabel"] = table#153 { ["type"] = "literal", ["value"] = "Recursiveness and preference orderings", ["xml:lang"] = "en", }, }, table#154 { ["itemType"] = table#155 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#156 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q691125", }, ["subjectLabel"] = table#157 { ["type"] = "literal", ["value"] = "Degrees of relative provability", ["xml:lang"] = "en", }, }, table#158 { ["itemType"] = table#159 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#160 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q692890", }, ["subjectLabel"] = table#161 { ["type"] = "literal", ["value"] = "Second-level algorithms, superrecursivity, and recovery problem in distributed systems", ["xml:lang"] = "en", }, }, table#162 { ["itemType"] = table#163 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#164 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q692926", }, ["subjectLabel"] = table#165 { ["type"] = "literal", ["value"] = "On empirical meaning of randomness with respect to parametric families of probability distributions", ["xml:lang"] = "en", }, }, table#166 { ["itemType"] = table#167 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#168 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q693046", }, ["subjectLabel"] = table#169 { ["type"] = "literal", ["value"] = "Program self-reference in constructive Scott subdomains", ["xml:lang"] = "en", }, }, table#170 { ["itemType"] = table#171 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#172 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q693054", }, ["subjectLabel"] = table#173 { ["type"] = "literal", ["value"] = "Representing hyper-arithmetical sets by equations over sets of integers", ["xml:lang"] = "en", }, }, table#174 { ["itemType"] = table#175 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#176 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q694202", }, ["subjectLabel"] = table#177 { ["type"] = "literal", ["value"] = "A semilattice of numberings. II", ["xml:lang"] = "en", }, }, table#178 { ["itemType"] = table#179 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#180 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q694226", }, ["subjectLabel"] = table#181 { ["type"] = "literal", ["value"] = "Fixed points for the jump operator", ["xml:lang"] = "en", }, }, table#182 { ["itemType"] = table#183 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#184 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q695798", }, ["subjectLabel"] = table#185 { ["type"] = "literal", ["value"] = "The computable embedding problem", ["xml:lang"] = "en", }, }, table#186 { ["itemType"] = table#187 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#188 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q695800", }, ["subjectLabel"] = table#189 { ["type"] = "literal", ["value"] = "Computably enumerable sets and related issues", ["xml:lang"] = "en", }, }, table#190 { ["itemType"] = table#191 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#192 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q695803", }, ["subjectLabel"] = table#193 { ["type"] = "literal", ["value"] = "Positive undecidable numberings in the Ershov hierarchy", ["xml:lang"] = "en", }, }, table#194 { ["itemType"] = table#195 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#196 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q714712", }, ["subjectLabel"] = table#197 { ["type"] = "literal", ["value"] = "Some new results on decidability for elementary algebra and geometry", ["xml:lang"] = "en", }, }, table#198 { ["itemType"] = table#199 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#200 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q714848", }, ["subjectLabel"] = table#201 { ["type"] = "literal", ["value"] = "Learning in the limit with lattice-structured hypothesis spaces", ["xml:lang"] = "en", }, }, table#202 { ["itemType"] = table#203 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#204 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q716463", }, ["subjectLabel"] = table#205 { ["type"] = "literal", ["value"] = "Finding non-trivial elements and splittings in groups.", ["xml:lang"] = "en", }, }, table#206 { ["itemType"] = table#207 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#208 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q721363", }, ["subjectLabel"] = table#209 { ["type"] = "literal", ["value"] = "The \$\\delta_\\alpha^0\$-computable enumerations of the classes of projective planes", ["xml:lang"] = "en", }, }, table#210 { ["itemType"] = table#211 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#212 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q733737", }, ["subjectLabel"] = table#213 { ["type"] = "literal", ["value"] = "Characterizing programming systems allowing program self-reference", ["xml:lang"] = "en", }, }, table#214 { ["itemType"] = table#215 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#216 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q733738", }, ["subjectLabel"] = table#217 { ["type"] = "literal", ["value"] = "Resource restricted computability theoretic learning: Illustrative topics and problems", ["xml:lang"] = "en", }, }, table#218 { ["itemType"] = table#219 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#220 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q733744", }, ["subjectLabel"] = table#221 { ["type"] = "literal", ["value"] = "Input-dependence in function-learning", ["xml:lang"] = "en", }, }, table#222 { ["itemType"] = table#223 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#224 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q733754", }, ["subjectLabel"] = table#225 { ["type"] = "literal", ["value"] = "Speed-up theorems in type-2 computations using oracle Turing machines", ["xml:lang"] = "en", }, }, table#226 { ["itemType"] = table#227 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#228 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q734207", }, ["subjectLabel"] = table#229 { ["type"] = "literal", ["value"] = "On the solution of trivalent decision problems by quantum state identification", ["xml:lang"] = "en", }, }, table#230 { ["itemType"] = table#231 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#232 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q750426", }, ["subjectLabel"] = table#233 { ["type"] = "literal", ["value"] = "Types of resemblance and of recursive isomorphism of partial recursive functions", ["xml:lang"] = "en", }, }, table#234 { ["itemType"] = table#235 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#236 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q750430", }, ["subjectLabel"] = table#237 { ["type"] = "literal", ["value"] = "Some applications of computable one-one numberings", ["xml:lang"] = "en", }, }, table#238 { ["itemType"] = table#239 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#240 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q751294", }, ["subjectLabel"] = table#241 { ["type"] = "literal", ["value"] = "The semantics of second-order lambda calculus", ["xml:lang"] = "en", }, }, table#242 { ["itemType"] = table#243 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#244 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q751711", }, ["subjectLabel"] = table#245 { ["type"] = "literal", ["value"] = "Kolmogorov-Stout law of the iterated logarithm", ["xml:lang"] = "en", }, }, table#246 { ["itemType"] = table#247 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#248 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q751812", }, ["subjectLabel"] = table#249 { ["type"] = "literal", ["value"] = "Cook reducibility is faster than Karp reducibility in NP", ["xml:lang"] = "en", }, }, table#250 { ["itemType"] = table#251 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#252 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q752705", }, ["subjectLabel"] = table#253 { ["type"] = "literal", ["value"] = "Some lattice-invariant properties of classes of recursively enumerable sets", ["xml:lang"] = "en", }, }, table#254 { ["itemType"] = table#255 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#256 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q752707", }, ["subjectLabel"] = table#257 { ["type"] = "literal", ["value"] = "Stability and computability in coherent domains", ["xml:lang"] = "en", }, }, table#258 { ["itemType"] = table#259 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#260 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q754652", }, ["subjectLabel"] = table#261 { ["type"] = "literal", ["value"] = "A note on the recursive enumerability of some classes of recursively enumerable languages", ["xml:lang"] = "en", }, }, table#262 { ["itemType"] = table#263 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#264 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q757357", }, ["subjectLabel"] = table#265 { ["type"] = "literal", ["value"] = "Determining and stationary sets for some classes of partial recursive functions", ["xml:lang"] = "en", }, }, table#266 { ["itemType"] = table#267 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#268 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q759011", }, ["subjectLabel"] = table#269 { ["type"] = "literal", ["value"] = "Elementary definability of symmetry groups", ["xml:lang"] = "en", }, }, table#270 { ["itemType"] = table#271 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#272 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q760416", }, ["subjectLabel"] = table#273 { ["type"] = "literal", ["value"] = "On combinatory algebras and their expansions", ["xml:lang"] = "en", }, }, table#274 { ["itemType"] = table#275 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#276 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q760795", }, ["subjectLabel"] = table#277 { ["type"] = "literal", ["value"] = "On the power of probabilistic strategies in inductive inference", ["xml:lang"] = "en", }, }, table#278 { ["itemType"] = table#279 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#280 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q761790", }, ["subjectLabel"] = table#281 { ["type"] = "literal", ["value"] = "Expressive power of typed and type-free programming languages", ["xml:lang"] = "en", }, }, table#282 { ["itemType"] = table#283 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#284 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q764273", }, ["subjectLabel"] = table#285 { ["type"] = "literal", ["value"] = "Computable de Finetti measures", ["xml:lang"] = "en", }, }, table#286 { ["itemType"] = table#287 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#288 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q765664", }, ["subjectLabel"] = table#289 { ["type"] = "literal", ["value"] = "Mass problems associated with effectively closed sets", ["xml:lang"] = "en", }, }, table#290 { ["itemType"] = table#291 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#292 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q779152", }, ["subjectLabel"] = table#293 { ["type"] = "literal", ["value"] = "The Tarski-Lindenbaum algebra of the class of all prime strongly constructivizable models of algorithmic dimension one", ["xml:lang"] = "en", }, }, table#294 { ["itemType"] = table#295 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#296 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q787965", }, ["subjectLabel"] = table#297 { ["type"] = "literal", ["value"] = "Computation of recursive functionals using minimal initial segments", ["xml:lang"] = "en", }, }, table#298 { ["itemType"] = table#299 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#300 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q789887", }, ["subjectLabel"] = table#301 { ["type"] = "literal", ["value"] = "Proving program inclusion using Hoare's logic", ["xml:lang"] = "en", }, }, table#302 { ["itemType"] = table#303 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#304 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q792083", }, ["subjectLabel"] = table#305 { ["type"] = "literal", ["value"] = "Propositional dynamic logic of nonregular programs", ["xml:lang"] = "en", }, }, table#306 { ["itemType"] = table#307 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#308 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q792753", }, ["subjectLabel"] = table#309 { ["type"] = "literal", ["value"] = "Implementation of data types by algebraic methods", ["xml:lang"] = "en", }, }, table#310 { ["itemType"] = table#311 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#312 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q792757", }, ["subjectLabel"] = table#313 { ["type"] = "literal", ["value"] = "A probabilistic dynamic logic", ["xml:lang"] = "en", }, }, table#314 { ["itemType"] = table#315 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#316 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q793716", }, ["subjectLabel"] = table#317 { ["type"] = "literal", ["value"] = "\$\\Sigma^ n_ 0\$-equivalence relations", ["xml:lang"] = "en", }, }, table#318 { ["itemType"] = table#319 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#320 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q794426", }, ["subjectLabel"] = table#321 { ["type"] = "literal", ["value"] = "Two theorems about the completeness of Hoare's logic", ["xml:lang"] = "en", }, }, table#322 { ["itemType"] = table#323 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#324 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q794446", }, ["subjectLabel"] = table#325 { ["type"] = "literal", ["value"] = "Note on a central lemma for learning theory", ["xml:lang"] = "en", }, }, table#326 { ["itemType"] = table#327 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#328 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q795039", }, ["subjectLabel"] = table#329 { ["type"] = "literal", ["value"] = "Reducibilities on real numbers", ["xml:lang"] = "en", }, }, table#330 { ["itemType"] = table#331 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#332 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q795810", }, ["subjectLabel"] = table#333 { ["type"] = "literal", ["value"] = "The knowing mathematician", ["xml:lang"] = "en", }, }, table#334 { ["itemType"] = table#335 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#336 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q796299", }, ["subjectLabel"] = table#337 { ["type"] = "literal", ["value"] = "Average case optimality for linear problems", ["xml:lang"] = "en", }, }, table#338 { ["itemType"] = table#339 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#340 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q797572", }, ["subjectLabel"] = table#341 { ["type"] = "literal", ["value"] = "Complexity of the index set of a constructive model", ["xml:lang"] = "en", }, }, table#342 { ["itemType"] = table#343 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#344 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q799667", }, ["subjectLabel"] = table#345 { ["type"] = "literal", ["value"] = "Hierarchies of hyperarithmetical sets and functions", ["xml:lang"] = "en", }, }, table#346 { ["itemType"] = table#347 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#348 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q802546", }, ["subjectLabel"] = table#349 { ["type"] = "literal", ["value"] = "Probabilistic Turing machines and recursively enumerable Dedekind cuts", ["xml:lang"] = "en", }, }, table#350 { ["itemType"] = table#351 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#352 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q803118", }, ["subjectLabel"] = table#353 { ["type"] = "literal", ["value"] = "Recursive-combinatorial properties of subsets of the natural numbers", ["xml:lang"] = "en", }, }, table#354 { ["itemType"] = table#355 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#356 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q803119", }, ["subjectLabel"] = table#357 { ["type"] = "literal", ["value"] = "One-sided error probabilistic inductive inference and reliable frequency identification", ["xml:lang"] = "en", }, }, table#358 { ["itemType"] = table#359 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#360 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q803121", }, ["subjectLabel"] = table#361 { ["type"] = "literal", ["value"] = "On the inference of approximate programs", ["xml:lang"] = "en", }, }, table#362 { ["itemType"] = table#363 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#364 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q804304", }, ["subjectLabel"] = table#365 { ["type"] = "literal", ["value"] = "Global and local views of state fairness", ["xml:lang"] = "en", }, }, table#366 { ["itemType"] = table#367 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#368 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q807035", }, ["subjectLabel"] = table#369 { ["type"] = "literal", ["value"] = "Computation theoretic aspects of cellular automata", ["xml:lang"] = "en", }, }, table#370 { ["itemType"] = table#371 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#372 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q807056", }, ["subjectLabel"] = table#373 { ["type"] = "literal", ["value"] = "Classifying circular cellular automata", ["xml:lang"] = "en", }, }, table#374 { ["itemType"] = table#375 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#376 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q809068", }, ["subjectLabel"] = table#377 { ["type"] = "literal", ["value"] = "An essay in combinatory dynamic logic", ["xml:lang"] = "en", }, }, table#378 { ["itemType"] = table#379 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#380 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q810001", }, ["subjectLabel"] = table#381 { ["type"] = "literal", ["value"] = "A decidable Ehrenfeucht theory with exactly two hyperarithmetic models", ["xml:lang"] = "en", }, }, table#382 { ["itemType"] = table#383 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#384 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q810008", }, ["subjectLabel"] = table#385 { ["type"] = "literal", ["value"] = "Generalizing classical and effective model theory in theories of operations and classes", ["xml:lang"] = "en", }, }, table#386 { ["itemType"] = table#387 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#388 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q811314", }, ["subjectLabel"] = table#389 { ["type"] = "literal", ["value"] = "A recursive counterexample to Debreu's theorem on the existence of a utility function", ["xml:lang"] = "en", }, }, table#390 { ["itemType"] = table#391 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#392 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q812396", }, ["subjectLabel"] = table#393 { ["type"] = "literal", ["value"] = "Learning via finitely many queries", ["xml:lang"] = "en", }, }, table#394 { ["itemType"] = table#395 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#396 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q816865", }, ["subjectLabel"] = table#397 { ["type"] = "literal", ["value"] = "Arithmetical complexity of fuzzy predicate logics -- a survey", ["xml:lang"] = "en", }, }, table#398 { ["itemType"] = table#399 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#400 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q817836", }, ["subjectLabel"] = table#401 { ["type"] = "literal", ["value"] = "A non-learnable class of E-pattern languages", ["xml:lang"] = "en", }, }, table#402 { ["itemType"] = table#403 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#404 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q263953", }, ["subjectLabel"] = table#405 { ["type"] = "literal", ["value"] = "Functional equations for the functions of real variables", ["xml:lang"] = "en", }, }, table#406 { ["itemType"] = table#407 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#408 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q266237", }, ["subjectLabel"] = table#409 { ["type"] = "literal", ["value"] = "A transformation scheme for infinitary first-order combinatorics presenting computational level of expressiveness in predicate logic", ["xml:lang"] = "en", }, }, table#410 { ["itemType"] = table#411 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#412 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q268079", }, ["subjectLabel"] = table#413 { ["type"] = "literal", ["value"] = "On hyperarithmetical realizability", ["xml:lang"] = "en", }, }, table#414 { ["itemType"] = table#415 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#416 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q281010", }, ["subjectLabel"] = table#417 { ["type"] = "literal", ["value"] = "On elementary theories of ordinal notation systems based on reflection principles", ["xml:lang"] = "en", }, }, table#418 { ["itemType"] = table#419 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#420 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q282117", }, ["subjectLabel"] = table#421 { ["type"] = "literal", ["value"] = "Orbits of maximal vector spaces", ["xml:lang"] = "en", }, }, table#422 { ["itemType"] = table#423 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#424 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q283098", }, ["subjectLabel"] = table#425 { ["type"] = "literal", ["value"] = "The bi-embeddability relation for finitely generated groups. II", ["xml:lang"] = "en", }, }, table#426 { ["itemType"] = table#427 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#428 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q283113", }, ["subjectLabel"] = table#429 { ["type"] = "literal", ["value"] = "Reverse mathematics, well-quasi-orders, and Noetherian spaces", ["xml:lang"] = "en", }, }, table#430 { ["itemType"] = table#431 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#432 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q287279", }, ["subjectLabel"] = table#433 { ["type"] = "literal", ["value"] = "Reverse complexity", ["xml:lang"] = "en", }, }, table#434 { ["itemType"] = table#435 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#436 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q294809", }, ["subjectLabel"] = table#437 { ["type"] = "literal", ["value"] = "How rich is the structure of the intrinsic complexity of learning", ["xml:lang"] = "en", }, }, table#438 { ["itemType"] = table#439 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#440 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q295632", }, ["subjectLabel"] = table#441 { ["type"] = "literal", ["value"] = "Equations over sets of integers with addition only", ["xml:lang"] = "en", }, }, table#442 { ["itemType"] = table#443 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#444 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q306821", }, ["subjectLabel"] = table#445 { ["type"] = "literal", ["value"] = "Implicit definability in arithmetic", ["xml:lang"] = "en", }, }, table#446 { ["itemType"] = table#447 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#448 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q324245", }, ["subjectLabel"] = table#449 { ["type"] = "literal", ["value"] = "Infinite games specified by 2-tape automata", ["xml:lang"] = "en", }, }, table#450 { ["itemType"] = table#451 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#452 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q329603", }, ["subjectLabel"] = table#453 { ["type"] = "literal", ["value"] = "A map of update constraints in inductive inference", ["xml:lang"] = "en", }, }, table#454 { ["itemType"] = table#455 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#456 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q342700", }, ["subjectLabel"] = table#457 { ["type"] = "literal", ["value"] = "Strongly non-U-shaped language learning results by general techniques", ["xml:lang"] = "en", }, }, table#458 { ["itemType"] = table#459 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#460 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q342717", }, ["subjectLabel"] = table#461 { ["type"] = "literal", ["value"] = "Enlarging learnable classes", ["xml:lang"] = "en", }, }, table#462 { ["itemType"] = table#463 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#464 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q355503", }, ["subjectLabel"] = table#465 { ["type"] = "literal", ["value"] = "Inferring descriptive generalisations of formal languages", ["xml:lang"] = "en", }, }, table#466 { ["itemType"] = table#467 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#468 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q595648", }, ["subjectLabel"] = table#469 { ["type"] = "literal", ["value"] = "Recursive coloration of countable graphs", ["xml:lang"] = "en", }, }, table#470 { ["itemType"] = table#471 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#472 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q596299", }, ["subjectLabel"] = table#473 { ["type"] = "literal", ["value"] = "Learning all subfunctions of a function", ["xml:lang"] = "en", }, }, table#474 { ["itemType"] = table#475 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#476 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q365661", }, ["subjectLabel"] = table#477 { ["type"] = "literal", ["value"] = "A note on definability in fragments of arithmetic with free unary predicates", ["xml:lang"] = "en", }, }, table#478 { ["itemType"] = table#479 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#480 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q598240", }, ["subjectLabel"] = table#481 { ["type"] = "literal", ["value"] = "On the classification of recursive languages", ["xml:lang"] = "en", }, }, table#482 { ["itemType"] = table#483 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#484 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q598270", }, ["subjectLabel"] = table#485 { ["type"] = "literal", ["value"] = "Tarski's theory of definability: Common themes in descriptive set theory, recursive function theory, classical pure logic, and finite-universe logic", ["xml:lang"] = "en", }, }, table#486 { ["itemType"] = table#487 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#488 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q598283", }, ["subjectLabel"] = table#489 { ["type"] = "literal", ["value"] = "Applying, extending, and specializing pseudorecursiveness", ["xml:lang"] = "en", }, }, table#490 { ["itemType"] = table#491 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#492 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q368710", }, ["subjectLabel"] = table#493 { ["type"] = "literal", ["value"] = "Simulation of effective subshifts by two-dimensional subshifts of finite type", ["xml:lang"] = "en", }, }, table#494 { ["itemType"] = table#495 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#496 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q606023", }, ["subjectLabel"] = table#497 { ["type"] = "literal", ["value"] = "Some constructions on the class of groups of computable automorphisms", ["xml:lang"] = "en", }, }, table#498 { ["itemType"] = table#499 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#500 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q606025", }, ["subjectLabel"] = table#501 { ["type"] = "literal", ["value"] = "On computable automorphisms in formal concept analysis", ["xml:lang"] = "en", }, }, table#502 { ["itemType"] = table#503 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#504 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q384749", }, ["subjectLabel"] = table#505 { ["type"] = "literal", ["value"] = "The FE-closure operator in countable-valued logic", ["xml:lang"] = "en", }, }, table#506 { ["itemType"] = table#507 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#508 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q388110", }, ["subjectLabel"] = table#509 { ["type"] = "literal", ["value"] = "Mind change speed-up for learning languages from positive data", ["xml:lang"] = "en", }, }, table#510 { ["itemType"] = table#511 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#512 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q390916", }, ["subjectLabel"] = table#513 { ["type"] = "literal", ["value"] = "Learning and classifying", ["xml:lang"] = "en", }, }, table#514 { ["itemType"] = table#515 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#516 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q391750", }, ["subjectLabel"] = table#517 { ["type"] = "literal", ["value"] = "Iterative learning from positive data and counters", ["xml:lang"] = "en", }, }, table#518 { ["itemType"] = table#519 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#520 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q393091", }, ["subjectLabel"] = table#521 { ["type"] = "literal", ["value"] = "Reactive Turing machines", ["xml:lang"] = "en", }, }, table#522 { ["itemType"] = table#523 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#524 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q393156", }, ["subjectLabel"] = table#525 { ["type"] = "literal", ["value"] = "On Goles' universal machines: a computational point of view", ["xml:lang"] = "en", }, }, table#526 { ["itemType"] = table#527 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#528 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q616506", }, ["subjectLabel"] = table#529 { ["type"] = "literal", ["value"] = "Computational processes, observers and Turing incompleteness", ["xml:lang"] = "en", }, }, table#530 { ["itemType"] = table#531 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#532 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q619320", }, ["subjectLabel"] = table#533 { ["type"] = "literal", ["value"] = "Descriptive properties on admissible sets", ["xml:lang"] = "en", }, }, table#534 { ["itemType"] = table#535 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#536 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q408165", }, ["subjectLabel"] = table#537 { ["type"] = "literal", ["value"] = "Streamlined subrecursive degree theory", ["xml:lang"] = "en", }, }, table#538 { ["itemType"] = table#539 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#540 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q409316", }, ["subjectLabel"] = table#541 { ["type"] = "literal", ["value"] = "Expressive power of digraph solvability", ["xml:lang"] = "en", }, }, table#542 { ["itemType"] = table#543 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#544 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q412013", }, ["subjectLabel"] = table#545 { ["type"] = "literal", ["value"] = "Intuitionistic logic and Muchnik degrees", ["xml:lang"] = "en", }, }, table#546 { ["itemType"] = table#547 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#548 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q415613", }, ["subjectLabel"] = table#549 { ["type"] = "literal", ["value"] = "Iterative learning from texts and counterexamples using additional information", ["xml:lang"] = "en", }, }, table#550 { ["itemType"] = table#551 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#552 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q627134", }, ["subjectLabel"] = table#553 { ["type"] = "literal", ["value"] = "Levels of undecidability in rewriting", ["xml:lang"] = "en", }, }, table#554 { ["itemType"] = table#555 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#556 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q627189", }, ["subjectLabel"] = table#557 { ["type"] = "literal", ["value"] = "The shrinking property for NP and coNP", ["xml:lang"] = "en", }, }, table#558 { ["itemType"] = table#559 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#560 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q418744", }, ["subjectLabel"] = table#561 { ["type"] = "literal", ["value"] = "Effectively approximating measurable sets by open sets", ["xml:lang"] = "en", }, }, table#562 { ["itemType"] = table#563 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#564 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q418791", }, ["subjectLabel"] = table#565 { ["type"] = "literal", ["value"] = "Computation as an unbounded process", ["xml:lang"] = "en", }, }, table#566 { ["itemType"] = table#567 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#568 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q424549", }, ["subjectLabel"] = table#569 { ["type"] = "literal", ["value"] = "Fine hierarchies via Priestley duality", ["xml:lang"] = "en", }, }, table#570 { ["itemType"] = table#571 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#572 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q431669", }, ["subjectLabel"] = table#573 { ["type"] = "literal", ["value"] = "Reducibility on families", ["xml:lang"] = "en", }, }, table#574 { ["itemType"] = table#575 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#576 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q431714", }, ["subjectLabel"] = table#577 { ["type"] = "literal", ["value"] = "Autostability of prime models under strong constructivizations", ["xml:lang"] = "en", }, }, table#578 { ["itemType"] = table#579 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#580 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q636283", }, ["subjectLabel"] = table#581 { ["type"] = "literal", ["value"] = "The complexity of recursive constraint satisfaction problems", ["xml:lang"] = "en", }, }, table#582 { ["itemType"] = table#583 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#584 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q636325", }, ["subjectLabel"] = table#585 { ["type"] = "literal", ["value"] = "The effective theory of Borel equivalence relations", ["xml:lang"] = "en", }, }, table#586 { ["itemType"] = table#587 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#588 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q638473", }, ["subjectLabel"] = table#589 { ["type"] = "literal", ["value"] = "Recursive analysis of singular ordinary differential equations", ["xml:lang"] = "en", }, }, table#590 { ["itemType"] = table#591 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#592 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q438597", }, ["subjectLabel"] = table#593 { ["type"] = "literal", ["value"] = "On the mathematical foundations of \\textit{Syntactic structures}", ["xml:lang"] = "en", }, }, table#594 { ["itemType"] = table#595 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#596 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q440010", }, ["subjectLabel"] = table#597 { ["type"] = "literal", ["value"] = "Learning with ordinal-bounded memory from positive data", ["xml:lang"] = "en", }, }, table#598 { ["itemType"] = table#599 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#600 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q639815", }, ["subjectLabel"] = table#601 { ["type"] = "literal", ["value"] = "Analogues of quantum complementarity in the theory of automata", ["xml:lang"] = "en", }, }, table#602 { ["itemType"] = table#603 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#604 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q640937", }, ["subjectLabel"] = table#605 { ["type"] = "literal", ["value"] = "Algorithmically finite groups.", ["xml:lang"] = "en", }, }, table#606 { ["itemType"] = table#607 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#608 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q642057", }, ["subjectLabel"] = table#609 { ["type"] = "literal", ["value"] = "Conditional geometric scales of discriminator varieties", ["xml:lang"] = "en", }, }, table#610 { ["itemType"] = table#611 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#612 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q642522", }, ["subjectLabel"] = table#613 { ["type"] = "literal", ["value"] = "Optimal language learning from positive data", ["xml:lang"] = "en", }, }, table#614 { ["itemType"] = table#615 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#616 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q653312", }, ["subjectLabel"] = table#617 { ["type"] = "literal", ["value"] = "Set systems: order types, continuous nondeterministic deformations, and quasi-orders", ["xml:lang"] = "en", }, }, table#618 { ["itemType"] = table#619 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#620 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q653340", }, ["subjectLabel"] = table#621 { ["type"] = "literal", ["value"] = "Immunity and pseudorandomness of context-free languages", ["xml:lang"] = "en", }, }, table#622 { ["itemType"] = table#623 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#624 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q465701", }, ["subjectLabel"] = table#625 { ["type"] = "literal", ["value"] = "A personal account of Turing's imprint on the development of computer science", ["xml:lang"] = "en", }, }, table#626 { ["itemType"] = table#627 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#628 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q467668", }, ["subjectLabel"] = table#629 { ["type"] = "literal", ["value"] = "Nonpresentability of the semigroup \$\\omega^\\omega\$ over \$\\mathbb H\\mathbb F(\\mathbb R)\$", ["xml:lang"] = "en", }, }, table#630 { ["itemType"] = table#631 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#632 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q661285", }, ["subjectLabel"] = table#633 { ["type"] = "literal", ["value"] = "Bounded enumeration reducibility and its degree structure", ["xml:lang"] = "en", }, }, table#634 { ["itemType"] = table#635 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#636 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q662344", }, ["subjectLabel"] = table#637 { ["type"] = "literal", ["value"] = "An implication of Gödel's incompleteness theorem. II: Not referring to the validity of oneself's assertion", ["xml:lang"] = "en", }, }, table#638 { ["itemType"] = table#639 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#640 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q494068", }, ["subjectLabel"] = table#641 { ["type"] = "literal", ["value"] = "Hardness of conjugacy, embedding and factorization of multidimensional subshifts", ["xml:lang"] = "en", }, }, table#642 { ["itemType"] = table#643 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#644 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q671360", }, ["subjectLabel"] = table#645 { ["type"] = "literal", ["value"] = "Frequency computation and bounded queries", ["xml:lang"] = "en", }, }, table#646 { ["itemType"] = table#647 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#648 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q671420", }, ["subjectLabel"] = table#649 { ["type"] = "literal", ["value"] = "Anomalous learning helps succinctness", ["xml:lang"] = "en", }, }, table#650 { ["itemType"] = table#651 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#652 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q672337", }, ["subjectLabel"] = table#653 { ["type"] = "literal", ["value"] = "Computing with infinitary logic", ["xml:lang"] = "en", }, }, table#654 { ["itemType"] = table#655 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#656 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q672752", }, ["subjectLabel"] = table#657 { ["type"] = "literal", ["value"] = "Effective category and measure in abstract complexity theory", ["xml:lang"] = "en", }, }, table#658 { ["itemType"] = table#659 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#660 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q673115", }, ["subjectLabel"] = table#661 { ["type"] = "literal", ["value"] = "P-selectivity: Intersections and indices", ["xml:lang"] = "en", }, }, table#662 { ["itemType"] = table#663 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#664 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q673625", }, ["subjectLabel"] = table#665 { ["type"] = "literal", ["value"] = "Some undecidable termination problems for semi-Thue systems", ["xml:lang"] = "en", }, }, table#666 { ["itemType"] = table#667 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#668 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q673972", }, ["subjectLabel"] = table#669 { ["type"] = "literal", ["value"] = "Computable concurrent processes", ["xml:lang"] = "en", }, }, table#670 { ["itemType"] = table#671 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#672 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q674181", }, ["subjectLabel"] = table#673 { ["type"] = "literal", ["value"] = "Training digraphs", ["xml:lang"] = "en", }, }, table#674 { ["itemType"] = table#675 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#676 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q674285", }, ["subjectLabel"] = table#677 { ["type"] = "literal", ["value"] = "On a question about learning nearly minimal programs", ["xml:lang"] = "en", }, }, table#678 { ["itemType"] = table#679 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#680 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q674401", }, ["subjectLabel"] = table#681 { ["type"] = "literal", ["value"] = "Case-based representation and learning of pattern languages", ["xml:lang"] = "en", }, }, table#682 { ["itemType"] = table#683 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#684 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q674404", }, ["subjectLabel"] = table#685 { ["type"] = "literal", ["value"] = "Towards a mathematical theory of machine discovery from facts", ["xml:lang"] = "en", }, }, table#686 { ["itemType"] = table#687 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#688 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q676185", }, ["subjectLabel"] = table#689 { ["type"] = "literal", ["value"] = "Tarskian and Kripkean truth", ["xml:lang"] = "en", }, }, table#690 { ["itemType"] = table#691 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#692 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q676310", }, ["subjectLabel"] = table#693 { ["type"] = "literal", ["value"] = "The self-embedding theorem of \$\\text{WKL}_ 0\$ and a non-standard method", ["xml:lang"] = "en", }, }, table#694 { ["itemType"] = table#695 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#696 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q676311", }, ["subjectLabel"] = table#697 { ["type"] = "literal", ["value"] = "Characterizing language identification in terms of computable numberings", ["xml:lang"] = "en", }, }, table#698 { ["itemType"] = table#699 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#700 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q504325", }, ["subjectLabel"] = table#701 { ["type"] = "literal", ["value"] = "Proper divisibility in computable rings", ["xml:lang"] = "en", }, }, table#702 { ["itemType"] = table#703 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#704 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q508830", }, ["subjectLabel"] = table#705 { ["type"] = "literal", ["value"] = "Ordinals and graph decompositions", ["xml:lang"] = "en", }, }, table#706 { ["itemType"] = table#707 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#708 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q679981", }, ["subjectLabel"] = table#709 { ["type"] = "literal", ["value"] = "Register machines with counters", ["xml:lang"] = "en", }, }, table#710 { ["itemType"] = table#711 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#712 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q514569", }, ["subjectLabel"] = table#713 { ["type"] = "literal", ["value"] = "Complexity of equational theory of relational algebras with standard projection elements", ["xml:lang"] = "en", }, }, table#714 { ["itemType"] = table#715 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#716 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q685073", }, ["subjectLabel"] = table#717 { ["type"] = "literal", ["value"] = "The analytical completeness of Dzhaparidze's polymodal logics", ["xml:lang"] = "en", }, }, table#718 { ["itemType"] = table#719 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#720 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q685478", }, ["subjectLabel"] = table#721 { ["type"] = "literal", ["value"] = "On the non-existence of maximal inference degrees for language identification", ["xml:lang"] = "en", }, }, table#722 { ["itemType"] = table#723 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#724 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q686644", }, ["subjectLabel"] = table#725 { ["type"] = "literal", ["value"] = "Algebraic and calculus query languages for recursively typed complex objects", ["xml:lang"] = "en", }, }, table#726 { ["itemType"] = table#727 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#728 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q687278", }, ["subjectLabel"] = table#729 { ["type"] = "literal", ["value"] = "Peano arithmetic as axiomatization of the time frame in logics of programs and in dynamic logics", ["xml:lang"] = "en", }, }, table#730 { ["itemType"] = table#731 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#732 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q687281", }, ["subjectLabel"] = table#733 { ["type"] = "literal", ["value"] = "Recursive properties of relations on models", ["xml:lang"] = "en", }, }, table#734 { ["itemType"] = table#735 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#736 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q688157", }, ["subjectLabel"] = table#737 { ["type"] = "literal", ["value"] = "If not empty, NP-P is topologically large", ["xml:lang"] = "en", }, }, table#738 { ["itemType"] = table#739 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#740 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q527399", }, ["subjectLabel"] = table#741 { ["type"] = "literal", ["value"] = "Frugal bribery in voting", ["xml:lang"] = "en", }, }, table#742 { ["itemType"] = table#743 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#744 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q535142", }, ["subjectLabel"] = table#745 { ["type"] = "literal", ["value"] = "Topological aspects of the Medvedev lattice", ["xml:lang"] = "en", }, }, table#746 { ["itemType"] = table#747 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#748 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q535145", }, ["subjectLabel"] = table#749 { ["type"] = "literal", ["value"] = "Immunity properties and strong positive reducibilities", ["xml:lang"] = "en", }, }, table#750 { ["itemType"] = table#751 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#752 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q537911", }, ["subjectLabel"] = table#753 { ["type"] = "literal", ["value"] = "Topological dynamics of cellular automata: dimension matters", ["xml:lang"] = "en", }, }, table#754 { ["itemType"] = table#755 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#756 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q553319", }, ["subjectLabel"] = table#757 { ["type"] = "literal", ["value"] = "Hypothesis spaces for learning", ["xml:lang"] = "en", }, }, table#758 { ["itemType"] = table#759 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#760 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q579238", }, ["subjectLabel"] = table#761 { ["type"] = "literal", ["value"] = "Theory of Abelian groups with constructive models", ["xml:lang"] = "en", }, }, table#762 { ["itemType"] = table#763 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#764 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q579241", }, ["subjectLabel"] = table#765 { ["type"] = "literal", ["value"] = "Graph colorings and recursively bounded \$\\Pi ^ 0_ 1\$-classes", ["xml:lang"] = "en", }, }, table#766 { ["itemType"] = table#767 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#768 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q579244", }, ["subjectLabel"] = table#769 { ["type"] = "literal", ["value"] = "Hierarchies of torsion-free Abelian groups", ["xml:lang"] = "en", }, }, table#770 { ["itemType"] = table#771 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#772 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q579245", }, ["subjectLabel"] = table#773 { ["type"] = "literal", ["value"] = "Computability in higher types, P\$\\omega\$ and the completeness of type assignment", ["xml:lang"] = "en", }, }, table#774 { ["itemType"] = table#775 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#776 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q580331", }, ["subjectLabel"] = table#777 { ["type"] = "literal", ["value"] = "The number of computable indexations of finite classes of constructive models", ["xml:lang"] = "en", }, }, table#778 { ["itemType"] = table#779 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#780 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q580332", }, ["subjectLabel"] = table#781 { ["type"] = "literal", ["value"] = "Turing complexity of the ordinals", ["xml:lang"] = "en", }, }, table#782 { ["itemType"] = table#783 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#784 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q581396", }, ["subjectLabel"] = table#785 { ["type"] = "literal", ["value"] = "Adjointness in recursion", ["xml:lang"] = "en", }, }, table#786 { ["itemType"] = table#787 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#788 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q582908", }, ["subjectLabel"] = table#789 { ["type"] = "literal", ["value"] = "Computable one-to-one enumerations of effective domains", ["xml:lang"] = "en", }, }, table#790 { ["itemType"] = table#791 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#792 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q583200", }, ["subjectLabel"] = table#793 { ["type"] = "literal", ["value"] = "Completeness in the arithmetical hierarchy and fixed points", ["xml:lang"] = "en", }, }, table#794 { ["itemType"] = table#795 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#796 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q585192", }, ["subjectLabel"] = table#797 { ["type"] = "literal", ["value"] = "Comparison of identification criteria for machine inductive inference", ["xml:lang"] = "en", }, }, table#798 { ["itemType"] = table#799 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#800 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q259061", }, ["subjectLabel"] = table#801 { ["type"] = "literal", ["value"] = "On the role of update constraints and text-types in iterative learning", ["xml:lang"] = "en", }, }, table#802 { ["itemType"] = table#803 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#804 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1077409", }, ["subjectLabel"] = table#805 { ["type"] = "literal", ["value"] = "Examples of nonautostable systems", ["xml:lang"] = "en", }, }, table#806 { ["itemType"] = table#807 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#808 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1077412", }, ["subjectLabel"] = table#809 { ["type"] = "literal", ["value"] = "Reductions among polynomial isomorphism types", ["xml:lang"] = "en", }, }, table#810 { ["itemType"] = table#811 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#812 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1078170", }, ["subjectLabel"] = table#813 { ["type"] = "literal", ["value"] = "e- and s-degrees", ["xml:lang"] = "en", }, }, table#814 { ["itemType"] = table#815 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#816 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1078173", }, ["subjectLabel"] = table#817 { ["type"] = "literal", ["value"] = "Hierarchy of limiting computations", ["xml:lang"] = "en", }, }, table#818 { ["itemType"] = table#819 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#820 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1078175", }, ["subjectLabel"] = table#821 { ["type"] = "literal", ["value"] = "The basic theory of partial \$\\alpha\$-recursive operators", ["xml:lang"] = "en", }, }, table#822 { ["itemType"] = table#823 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#824 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1079364", }, ["subjectLabel"] = table#825 { ["type"] = "literal", ["value"] = "Some remarks on witness functions for nonpolynomial and noncomplete sets in NP", ["xml:lang"] = "en", }, }, table#826 { ["itemType"] = table#827 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#828 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1080652", }, ["subjectLabel"] = table#829 { ["type"] = "literal", ["value"] = "Structured algebraic specifications: A kernel language", ["xml:lang"] = "en", }, }, table#830 { ["itemType"] = table#831 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#832 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1082813", }, ["subjectLabel"] = table#833 { ["type"] = "literal", ["value"] = "On the structure of one-tape nondeterministic Turing machine time hierarchy", ["xml:lang"] = "en", }, }, table#834 { ["itemType"] = table#835 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#836 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1083447", }, ["subjectLabel"] = table#837 { ["type"] = "literal", ["value"] = "Structural interactions of the recursively enumerable T- and W-degrees", ["xml:lang"] = "en", }, }, table#838 { ["itemType"] = table#839 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#840 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1084100", }, ["subjectLabel"] = table#841 { ["type"] = "literal", ["value"] = "Members of countable \$\\Pi ^ 0_ 1\$ classes", ["xml:lang"] = "en", }, }, table#842 { ["itemType"] = table#843 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#844 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1085618", }, ["subjectLabel"] = table#845 { ["type"] = "literal", ["value"] = "Complexity of certain decision problems about congruential languages", ["xml:lang"] = "en", }, }, table#846 { ["itemType"] = table#847 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#848 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1087326", }, ["subjectLabel"] = table#849 { ["type"] = "literal", ["value"] = "Scott induction and closure under \$\\omega\$-sups", ["xml:lang"] = "en", }, }, table#850 { ["itemType"] = table#851 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#852 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1088417", }, ["subjectLabel"] = table#853 { ["type"] = "literal", ["value"] = "Alternation and \$\\omega\$-type Turing acceptors", ["xml:lang"] = "en", }, }, table#854 { ["itemType"] = table#855 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#856 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1088659", }, ["subjectLabel"] = table#857 { ["type"] = "literal", ["value"] = "Approximation to measurable functions and its relation to probabilistic computation", ["xml:lang"] = "en", }, }, table#858 { ["itemType"] = table#859 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#860 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1089258", }, ["subjectLabel"] = table#861 { ["type"] = "literal", ["value"] = "Representability in mixed integer programming. I: Characterization results", ["xml:lang"] = "en", }, }, table#862 { ["itemType"] = table#863 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#864 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q912648", }, ["subjectLabel"] = table#865 { ["type"] = "literal", ["value"] = "Prudence and other conditions on formal language learning", ["xml:lang"] = "en", }, }, table#866 { ["itemType"] = table#867 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#868 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q912772", }, ["subjectLabel"] = table#869 { ["type"] = "literal", ["value"] = "A note on degrees of presentation of games as relational structures", ["xml:lang"] = "en", }, }, table#870 { ["itemType"] = table#871 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#872 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q913786", }, ["subjectLabel"] = table#873 { ["type"] = "literal", ["value"] = "An easy priority-free proof of a theorem of Friedberg", ["xml:lang"] = "en", }, }, table#874 { ["itemType"] = table#875 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#876 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q916650", }, ["subjectLabel"] = table#877 { ["type"] = "literal", ["value"] = "Kolmogorov complexity and degrees of tally sets", ["xml:lang"] = "en", }, }, table#878 { ["itemType"] = table#879 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#880 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q916651", }, ["subjectLabel"] = table#881 { ["type"] = "literal", ["value"] = "On some filters and ideals of the Medvedev lattice", ["xml:lang"] = "en", }, }, table#882 { ["itemType"] = table#883 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#884 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q920081", }, ["subjectLabel"] = table#885 { ["type"] = "literal", ["value"] = "Inductive full satisfaction classes", ["xml:lang"] = "en", }, }, table#886 { ["itemType"] = table#887 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#888 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q920814", }, ["subjectLabel"] = table#889 { ["type"] = "literal", ["value"] = "Rationality, computability, and complexity", ["xml:lang"] = "en", }, }, table#890 { ["itemType"] = table#891 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#892 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q922525", }, ["subjectLabel"] = table#893 { ["type"] = "literal", ["value"] = "On the complexity of finding the chromatic number of a recursive graph. II: The unbounded case", ["xml:lang"] = "en", }, }, table#894 { ["itemType"] = table#895 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#896 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q922528", }, ["subjectLabel"] = table#897 { ["type"] = "literal", ["value"] = "On a complexity-based way of constructivizing the recursive functions", ["xml:lang"] = "en", }, }, table#898 { ["itemType"] = table#899 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#900 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q923076", }, ["subjectLabel"] = table#901 { ["type"] = "literal", ["value"] = "Labelling systems and r.e. structures", ["xml:lang"] = "en", }, }, table#902 { ["itemType"] = table#903 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#904 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q924164", }, ["subjectLabel"] = table#905 { ["type"] = "literal", ["value"] = "Learning recursive functions: A survey", ["xml:lang"] = "en", }, }, table#906 { ["itemType"] = table#907 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#908 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q924166", }, ["subjectLabel"] = table#909 { ["type"] = "literal", ["value"] = "Reflective inductive inference of recursive functions", ["xml:lang"] = "en", }, }, table#910 { ["itemType"] = table#911 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#912 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q924168", }, ["subjectLabel"] = table#913 { ["type"] = "literal", ["value"] = "Quantum inductive inference by finite automata", ["xml:lang"] = "en", }, }, table#914 { ["itemType"] = table#915 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#916 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q924172", }, ["subjectLabel"] = table#917 { ["type"] = "literal", ["value"] = "Absolute versus probabilistic classification in a logical setting", ["xml:lang"] = "en", }, }, table#918 { ["itemType"] = table#919 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#920 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q924176", }, ["subjectLabel"] = table#921 { ["type"] = "literal", ["value"] = "Discontinuities in pattern inference", ["xml:lang"] = "en", }, }, table#922 { ["itemType"] = table#923 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#924 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q924178", }, ["subjectLabel"] = table#925 { ["type"] = "literal", ["value"] = "Learning and extending sublanguages", ["xml:lang"] = "en", }, }, table#926 { ["itemType"] = table#927 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#928 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q924730", }, ["subjectLabel"] = table#929 { ["type"] = "literal", ["value"] = "When unlearning helps", ["xml:lang"] = "en", }, }, table#930 { ["itemType"] = table#931 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#932 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q926187", }, ["subjectLabel"] = table#933 { ["type"] = "literal", ["value"] = "Effectively closed sets and enumerations", ["xml:lang"] = "en", }, }, table#934 { ["itemType"] = table#935 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#936 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q927865", }, ["subjectLabel"] = table#937 { ["type"] = "literal", ["value"] = "Learning languages from positive data and negative counterexamples", ["xml:lang"] = "en", }, }, table#938 { ["itemType"] = table#939 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#940 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q927866", }, ["subjectLabel"] = table#941 { ["type"] = "literal", ["value"] = "Probabilistic and team PFIN-type learning: General properties", ["xml:lang"] = "en", }, }, table#942 { ["itemType"] = table#943 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#944 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q927871", }, ["subjectLabel"] = table#945 { ["type"] = "literal", ["value"] = "Learning with belief levels", ["xml:lang"] = "en", }, }, table#946 { ["itemType"] = table#947 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#948 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q930875", }, ["subjectLabel"] = table#949 { ["type"] = "literal", ["value"] = "Computability and the morphological complexity of some dynamics on continuous domains", ["xml:lang"] = "en", }, }, table#950 { ["itemType"] = table#951 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#952 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q938241", }, ["subjectLabel"] = table#953 { ["type"] = "literal", ["value"] = "Sheaf toposes for realizability", ["xml:lang"] = "en", }, }, table#954 { ["itemType"] = table#955 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#956 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q939445", }, ["subjectLabel"] = table#957 { ["type"] = "literal", ["value"] = "Learning in Friedberg numberings", ["xml:lang"] = "en", }, }, table#958 { ["itemType"] = table#959 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#960 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q943340", }, ["subjectLabel"] = table#961 { ["type"] = "literal", ["value"] = "On Lachlan's major sub-degree problem", ["xml:lang"] = "en", }, }, table#962 { ["itemType"] = table#963 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#964 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q944222", }, ["subjectLabel"] = table#965 { ["type"] = "literal", ["value"] = "Topological complexity of locally finite \$\\omega\$-languages", ["xml:lang"] = "en", }, }, table#966 { ["itemType"] = table#967 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#968 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q948910", }, ["subjectLabel"] = table#969 { ["type"] = "literal", ["value"] = "A class of \$\\Sigma_{3}^{0}\$ modular lattices embeddable as principal filters in \${\\mathcal L}^*(V_\\infty)\$", ["xml:lang"] = "en", }, }, table#970 { ["itemType"] = table#971 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#972 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q948913", }, ["subjectLabel"] = table#973 { ["type"] = "literal", ["value"] = "Does truth-table of linear norm reduce the one-query tautologies to a random oracle?", ["xml:lang"] = "en", }, }, table#974 { ["itemType"] = table#975 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#976 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q949621", }, ["subjectLabel"] = table#977 { ["type"] = "literal", ["value"] = "Fine hierarchies and m-reducibilities in theoretical computer science", ["xml:lang"] = "en", }, }, table#978 { ["itemType"] = table#979 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#980 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q954212", }, ["subjectLabel"] = table#981 { ["type"] = "literal", ["value"] = "On two problems of Turing complexity for strongly minimal theories", ["xml:lang"] = "en", }, }, table#982 { ["itemType"] = table#983 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#984 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q958312", }, ["subjectLabel"] = table#985 { ["type"] = "literal", ["value"] = "Consistent and coherent learning with \$\\delta \$-delay", ["xml:lang"] = "en", }, }, table#986 { ["itemType"] = table#987 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#988 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q958482", }, ["subjectLabel"] = table#989 { ["type"] = "literal", ["value"] = "Structural properties of \$Q\$-degrees of n-c.e. sets", ["xml:lang"] = "en", }, }, table#990 { ["itemType"] = table#991 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#992 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q958489", }, ["subjectLabel"] = table#993 { ["type"] = "literal", ["value"] = "Computable categoricity and the Ershov hierarchy", ["xml:lang"] = "en", }, }, table#994 { ["itemType"] = table#995 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#996 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q972384", }, ["subjectLabel"] = table#997 { ["type"] = "literal", ["value"] = "Decision problems for language equations", ["xml:lang"] = "en", }, }, table#998 { ["itemType"] = table#999 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1000 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q972447", }, ["subjectLabel"] = table#1001 { ["type"] = "literal", ["value"] = "The diagonalization method in quantum recursion theory", ["xml:lang"] = "en", }, }, table#1002 { ["itemType"] = table#1003 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1004 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q976076", }, ["subjectLabel"] = table#1005 { ["type"] = "literal", ["value"] = "On some open problems in reflective inductive inference", ["xml:lang"] = "en", }, }, table#1006 { ["itemType"] = table#1007 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1008 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q982646", }, ["subjectLabel"] = table#1009 { ["type"] = "literal", ["value"] = "Iterative learning of simple external contextual languages", ["xml:lang"] = "en", }, }, table#1010 { ["itemType"] = table#1011 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1012 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q982647", }, ["subjectLabel"] = table#1013 { ["type"] = "literal", ["value"] = "Incremental learning with temporary memory", ["xml:lang"] = "en", }, }, table#1014 { ["itemType"] = table#1015 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1016 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q989527", }, ["subjectLabel"] = table#1017 { ["type"] = "literal", ["value"] = "On some open problems in monotonic and conservative learning", ["xml:lang"] = "en", }, }, table#1018 { ["itemType"] = table#1019 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1020 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q990079", }, ["subjectLabel"] = table#1021 { ["type"] = "literal", ["value"] = "Decision problems for Turing machines", ["xml:lang"] = "en", }, }, table#1022 { ["itemType"] = table#1023 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1024 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1004078", }, ["subjectLabel"] = table#1025 { ["type"] = "literal", ["value"] = "Computational virtuality in biological systems", ["xml:lang"] = "en", }, }, table#1026 { ["itemType"] = table#1027 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1028 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1005926", }, ["subjectLabel"] = table#1029 { ["type"] = "literal", ["value"] = "Chains and antichains in partial orderings", ["xml:lang"] = "en", }, }, table#1030 { ["itemType"] = table#1031 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1032 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1006728", }, ["subjectLabel"] = table#1033 { ["type"] = "literal", ["value"] = "Integrating external deduction tools with ACL2", ["xml:lang"] = "en", }, }, table#1034 { ["itemType"] = table#1035 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1036 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1009263", }, ["subjectLabel"] = table#1037 { ["type"] = "literal", ["value"] = "U-shaped, iterative, and iterative-with-counter learning", ["xml:lang"] = "en", }, }, table#1038 { ["itemType"] = table#1039 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1040 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1017657", }, ["subjectLabel"] = table#1041 { ["type"] = "literal", ["value"] = "On calibration error of randomized forecasting algorithms", ["xml:lang"] = "en", }, }, table#1042 { ["itemType"] = table#1043 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1044 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1017664", }, ["subjectLabel"] = table#1045 { ["type"] = "literal", ["value"] = "Parallelism increases iterative learning power", ["xml:lang"] = "en", }, }, table#1046 { ["itemType"] = table#1047 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1048 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1029327", }, ["subjectLabel"] = table#1049 { ["type"] = "literal", ["value"] = "One-shot learners using negative counterexamples and nearest positive examples", ["xml:lang"] = "en", }, }, table#1050 { ["itemType"] = table#1051 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1052 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1032637", }, ["subjectLabel"] = table#1053 { ["type"] = "literal", ["value"] = "Turing oracle machines, online computing, and three displacements in computability theory", ["xml:lang"] = "en", }, }, table#1054 { ["itemType"] = table#1055 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1056 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1035656", }, ["subjectLabel"] = table#1057 { ["type"] = "literal", ["value"] = "Arithmetical complexity of fuzzy predicate logics -- a survey. II.", ["xml:lang"] = "en", }, }, table#1058 { ["itemType"] = table#1059 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1060 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1036523", }, ["subjectLabel"] = table#1061 { ["type"] = "literal", ["value"] = "Computations via Newtonian and relativistic kinematic systems", ["xml:lang"] = "en", }, }, table#1062 { ["itemType"] = table#1063 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1064 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1036525", }, ["subjectLabel"] = table#1065 { ["type"] = "literal", ["value"] = "The influence of domain interpretations on computational models", ["xml:lang"] = "en", }, }, table#1066 { ["itemType"] = table#1067 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1068 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1036529", }, ["subjectLabel"] = table#1069 { ["type"] = "literal", ["value"] = "How to build a hypercomputer", ["xml:lang"] = "en", }, }, table#1070 { ["itemType"] = table#1071 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1072 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1047096", }, ["subjectLabel"] = table#1073 { ["type"] = "literal", ["value"] = "Complemented modular lattices with involution and orthogonal geometry", ["xml:lang"] = "en", }, }, table#1074 { ["itemType"] = table#1075 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1076 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1050334", }, ["subjectLabel"] = table#1077 { ["type"] = "literal", ["value"] = "Set-theoretical models of lambda-calculus: theories, expansions, isomorphisms", ["xml:lang"] = "en", }, }, table#1078 { ["itemType"] = table#1079 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1080 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1050980", }, ["subjectLabel"] = table#1081 { ["type"] = "literal", ["value"] = "Computable single-valued numerations", ["xml:lang"] = "en", }, }, table#1082 { ["itemType"] = table#1083 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1084 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1051428", }, ["subjectLabel"] = table#1085 { ["type"] = "literal", ["value"] = "A view of computability on term algebras", ["xml:lang"] = "en", }, }, table#1086 { ["itemType"] = table#1087 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1088 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1051633", }, ["subjectLabel"] = table#1089 { ["type"] = "literal", ["value"] = "A note on a theorem by Ladner", ["xml:lang"] = "en", }, }, table#1090 { ["itemType"] = table#1091 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1092 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1052097", }, ["subjectLabel"] = table#1093 { ["type"] = "literal", ["value"] = "A low and a high hierarchy within NP", ["xml:lang"] = "en", }, }, table#1094 { ["itemType"] = table#1095 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1096 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1054475", }, ["subjectLabel"] = table#1097 { ["type"] = "literal", ["value"] = "On self-reducibility and weak P-selectivity", ["xml:lang"] = "en", }, }, table#1098 { ["itemType"] = table#1099 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1100 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1056534", }, ["subjectLabel"] = table#1101 { ["type"] = "literal", ["value"] = "Ten years of Hoare's logic: A survey. II: Nondeterminism", ["xml:lang"] = "en", }, }, table#1102 { ["itemType"] = table#1103 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1104 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1057259", }, ["subjectLabel"] = table#1105 { ["type"] = "literal", ["value"] = "Decidability and the number of countable models", ["xml:lang"] = "en", }, }, table#1106 { ["itemType"] = table#1107 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1108 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1060297", }, ["subjectLabel"] = table#1109 { ["type"] = "literal", ["value"] = "Strongly constructive Abelian p-groups", ["xml:lang"] = "en", }, }, table#1110 { ["itemType"] = table#1111 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1112 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1062050", }, ["subjectLabel"] = table#1113 { ["type"] = "literal", ["value"] = "Positive numerations of families with one-valued numerations", ["xml:lang"] = "en", }, }, table#1114 { ["itemType"] = table#1115 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1116 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1062977", }, ["subjectLabel"] = table#1117 { ["type"] = "literal", ["value"] = "Recursive properties of Euclidean domains", ["xml:lang"] = "en", }, }, table#1118 { ["itemType"] = table#1119 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1120 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1067771", }, ["subjectLabel"] = table#1121 { ["type"] = "literal", ["value"] = "The unwind property for programs with bounded memory", ["xml:lang"] = "en", }, }, table#1122 { ["itemType"] = table#1123 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1124 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1068536", }, ["subjectLabel"] = table#1125 { ["type"] = "literal", ["value"] = "On one-one polynomial time equivalence relations", ["xml:lang"] = "en", }, }, table#1126 { ["itemType"] = table#1127 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1128 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1068562", }, ["subjectLabel"] = table#1129 { ["type"] = "literal", ["value"] = "Admissible representations of effective cpo's", ["xml:lang"] = "en", }, }, table#1130 { ["itemType"] = table#1131 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1132 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1068816", }, ["subjectLabel"] = table#1133 { ["type"] = "literal", ["value"] = "Computations with oracles", ["xml:lang"] = "en", }, }, table#1134 { ["itemType"] = table#1135 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1136 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1068818", }, ["subjectLabel"] = table#1137 { ["type"] = "literal", ["value"] = "Index sets in the hyperarithmetical hierarchy", ["xml:lang"] = "en", }, }, table#1138 { ["itemType"] = table#1139 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1140 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1071017", }, ["subjectLabel"] = table#1141 { ["type"] = "literal", ["value"] = "The lack of definable witnesses and provably recursive functions in intuitionistic set theories", ["xml:lang"] = "en", }, }, table#1142 { ["itemType"] = table#1143 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1144 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1071019", }, ["subjectLabel"] = table#1145 { ["type"] = "literal", ["value"] = "Arithmetic transfinite induction and recursive well-orderings", ["xml:lang"] = "en", }, }, table#1146 { ["itemType"] = table#1147 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1148 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1071500", }, ["subjectLabel"] = table#1149 { ["type"] = "literal", ["value"] = "Independence results about context-free languages and lower bounds", ["xml:lang"] = "en", }, }, table#1150 { ["itemType"] = table#1151 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1152 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1071512", }, ["subjectLabel"] = table#1153 { ["type"] = "literal", ["value"] = "Uncontrollable computational growth in theoretical physics", ["xml:lang"] = "en", }, }, table#1154 { ["itemType"] = table#1155 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1156 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1071525", }, ["subjectLabel"] = table#1157 { ["type"] = "literal", ["value"] = "The implication and finite implication problems for typed template dependencies", ["xml:lang"] = "en", }, }, table#1158 { ["itemType"] = table#1159 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1160 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1071757", }, ["subjectLabel"] = table#1161 { ["type"] = "literal", ["value"] = "A criterion for strong constructivizability of a class of abelian p- groups", ["xml:lang"] = "en", }, }, table#1162 { ["itemType"] = table#1163 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1164 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1071761", }, ["subjectLabel"] = table#1165 { ["type"] = "literal", ["value"] = "Upper semilattice of recursively enumerable Q-degrees", ["xml:lang"] = "en", }, }, table#1166 { ["itemType"] = table#1167 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1168 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1072545", }, ["subjectLabel"] = table#1169 { ["type"] = "literal", ["value"] = "On effectively computable realizations of choice functions", ["xml:lang"] = "en", }, }, table#1170 { ["itemType"] = table#1171 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1172 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1072546", }, ["subjectLabel"] = table#1173 { ["type"] = "literal", ["value"] = "The minimum degree of recursively representable choice functions", ["xml:lang"] = "en", }, }, table#1174 { ["itemType"] = table#1175 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1176 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1072705", }, ["subjectLabel"] = table#1177 { ["type"] = "literal", ["value"] = "Computation theory of cellular automata", ["xml:lang"] = "en", }, }, table#1178 { ["itemType"] = table#1179 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1180 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1073015", }, ["subjectLabel"] = table#1181 { ["type"] = "literal", ["value"] = "Complexity results on the conjugacy problem for monoids", ["xml:lang"] = "en", }, }, table#1182 { ["itemType"] = table#1183 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1184 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1073021", }, ["subjectLabel"] = table#1185 { ["type"] = "literal", ["value"] = "Type 2 recursion theory", ["xml:lang"] = "en", }, }, table#1186 { ["itemType"] = table#1187 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1188 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1073022", }, ["subjectLabel"] = table#1189 { ["type"] = "literal", ["value"] = "Theory of representations", ["xml:lang"] = "en", }, }, table#1190 { ["itemType"] = table#1191 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1192 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1073331", }, ["subjectLabel"] = table#1193 { ["type"] = "literal", ["value"] = "Some algorithmic problems for projective planes", ["xml:lang"] = "en", }, }, table#1194 { ["itemType"] = table#1195 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1196 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1074575", }, ["subjectLabel"] = table#1197 { ["type"] = "literal", ["value"] = "Undecidability of some elementary theories over PAC fields", ["xml:lang"] = "en", }, }, table#1198 { ["itemType"] = table#1199 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1200 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1075317", }, ["subjectLabel"] = table#1201 { ["type"] = "literal", ["value"] = "Connection between constructivizibility and strong constructivizibility for different classes of Abelian groups", ["xml:lang"] = "en", }, }, table#1202 { ["itemType"] = table#1203 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1204 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1091820", }, ["subjectLabel"] = table#1205 { ["type"] = "literal", ["value"] = "How to prove representation-independent independence results", ["xml:lang"] = "en", }, }, table#1206 { ["itemType"] = table#1207 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1208 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1093629", }, ["subjectLabel"] = table#1209 { ["type"] = "literal", ["value"] = "Maximal theories", ["xml:lang"] = "en", }, }, table#1210 { ["itemType"] = table#1211 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1212 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1093630", }, ["subjectLabel"] = table#1213 { ["type"] = "literal", ["value"] = "Recursion theory and ordered groups", ["xml:lang"] = "en", }, }, table#1214 { ["itemType"] = table#1215 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1216 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1094410", }, ["subjectLabel"] = table#1217 { ["type"] = "literal", ["value"] = "Stability of recursive structures in arithmetical degrees", ["xml:lang"] = "en", }, }, table#1218 { ["itemType"] = table#1219 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1220 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1094411", }, ["subjectLabel"] = table#1221 { ["type"] = "literal", ["value"] = "Computable groups of automorphisms of models", ["xml:lang"] = "en", }, }, table#1222 { ["itemType"] = table#1223 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1224 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1094421", }, ["subjectLabel"] = table#1225 { ["type"] = "literal", ["value"] = "Constructing recursion operators in intuitionistic type theory", ["xml:lang"] = "en", }, }, table#1226 { ["itemType"] = table#1227 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1228 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1094875", }, ["subjectLabel"] = table#1229 { ["type"] = "literal", ["value"] = "Honest polynomial degrees and \$P=?NP\$", ["xml:lang"] = "en", }, }, table#1230 { ["itemType"] = table#1231 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1232 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1095655", }, ["subjectLabel"] = table#1233 { ["type"] = "literal", ["value"] = "First-order approximation of algorithmic theories", ["xml:lang"] = "en", }, }, table#1234 { ["itemType"] = table#1235 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1236 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1096627", }, ["subjectLabel"] = table#1237 { ["type"] = "literal", ["value"] = "On the continued fraction representation of computable real numbers", ["xml:lang"] = "en", }, }, table#1238 { ["itemType"] = table#1239 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1240 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1097266", }, ["subjectLabel"] = table#1241 { ["type"] = "literal", ["value"] = "Expressibility in the elementary theory of recursively enumerable sets with realizability logic", ["xml:lang"] = "en", }, }, table#1242 { ["itemType"] = table#1243 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1244 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1097692", }, ["subjectLabel"] = table#1245 { ["type"] = "literal", ["value"] = "A comparison of polynomial time completeness notions", ["xml:lang"] = "en", }, }, table#1246 { ["itemType"] = table#1247 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1248 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1097880", }, ["subjectLabel"] = table#1249 { ["type"] = "literal", ["value"] = "The axiom of determinacy and the modern development of descriptive set theory", ["xml:lang"] = "en", }, }, table#1250 { ["itemType"] = table#1251 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1252 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1097884", }, ["subjectLabel"] = table#1253 { ["type"] = "literal", ["value"] = "Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes", ["xml:lang"] = "en", }, }, table#1254 { ["itemType"] = table#1255 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1256 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1098613", }, ["subjectLabel"] = table#1257 { ["type"] = "literal", ["value"] = "Algebraic specifications of computable and semicomputable data types", ["xml:lang"] = "en", }, }, table#1258 { ["itemType"] = table#1259 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1260 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1100460", }, ["subjectLabel"] = table#1261 { ["type"] = "literal", ["value"] = "Partial ordering of degrees of alternative m-reducibility", ["xml:lang"] = "en", }, }, table#1262 { ["itemType"] = table#1263 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1264 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1101310", }, ["subjectLabel"] = table#1265 { ["type"] = "literal", ["value"] = "Social choice and computational complexity", ["xml:lang"] = "en", }, }, table#1266 { ["itemType"] = table#1267 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1268 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1101444", }, ["subjectLabel"] = table#1269 { ["type"] = "literal", ["value"] = "A class of recursively enumerable sets", ["xml:lang"] = "en", }, }, table#1270 { ["itemType"] = table#1271 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1272 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1102949", }, ["subjectLabel"] = table#1273 { ["type"] = "literal", ["value"] = "Recursion theorems and effective domains", ["xml:lang"] = "en", }, }, table#1274 { ["itemType"] = table#1275 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1276 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1102954", }, ["subjectLabel"] = table#1277 { ["type"] = "literal", ["value"] = "Decidability, partial decidability and sharpness relation for L-subsets", ["xml:lang"] = "en", }, }, table#1278 { ["itemType"] = table#1279 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1280 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1103615", }, ["subjectLabel"] = table#1281 { ["type"] = "literal", ["value"] = "Castor quadruplorum", ["xml:lang"] = "en", }, }, table#1282 { ["itemType"] = table#1283 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1284 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1106203", }, ["subjectLabel"] = table#1285 { ["type"] = "literal", ["value"] = "Intrinsically \$\\Sigma ^ 0_{\\alpha}\$ relations", ["xml:lang"] = "en", }, }, table#1286 { ["itemType"] = table#1287 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1288 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1106754", }, ["subjectLabel"] = table#1289 { ["type"] = "literal", ["value"] = "Lower bounds on degrees of game-theoretic structures", ["xml:lang"] = "en", }, }, table#1290 { ["itemType"] = table#1291 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1292 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1106842", }, ["subjectLabel"] = table#1293 { ["type"] = "literal", ["value"] = "Index sets in the arithmetical hierarchy", ["xml:lang"] = "en", }, }, table#1294 { ["itemType"] = table#1295 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1296 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1108262", }, ["subjectLabel"] = table#1297 { ["type"] = "literal", ["value"] = "Structural properties of computable classes of contructive models", ["xml:lang"] = "en", }, }, table#1298 { ["itemType"] = table#1299 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1300 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1108264", }, ["subjectLabel"] = table#1301 { ["type"] = "literal", ["value"] = "Algorithmic complexity of the problem of occurrence in commutants and members of the lower central series", ["xml:lang"] = "en", }, }, table#1302 { ["itemType"] = table#1303 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1304 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1108914", }, ["subjectLabel"] = table#1305 { ["type"] = "literal", ["value"] = "An infinite version of Arrow's theorem in the effective setting", ["xml:lang"] = "en", }, }, table#1306 { ["itemType"] = table#1307 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1308 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1109126", }, ["subjectLabel"] = table#1309 { ["type"] = "literal", ["value"] = "Partial morphisms in categories of effective objects", ["xml:lang"] = "en", }, }, table#1310 { ["itemType"] = table#1311 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1312 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1109766", }, ["subjectLabel"] = table#1313 { ["type"] = "literal", ["value"] = "Collapsing degrees", ["xml:lang"] = "en", }, }, table#1314 { ["itemType"] = table#1315 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1316 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1110500", }, ["subjectLabel"] = table#1317 { ["type"] = "literal", ["value"] = "Some general incompleteness results for partial correctness logics", ["xml:lang"] = "en", }, }, table#1318 { ["itemType"] = table#1319 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1320 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1112021", }, ["subjectLabel"] = table#1321 { ["type"] = "literal", ["value"] = "A remark on the length problem", ["xml:lang"] = "en", }, }, table#1322 { ["itemType"] = table#1323 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1324 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1112624", }, ["subjectLabel"] = table#1325 { ["type"] = "literal", ["value"] = "Iterated GSMs and CO-CFL", ["xml:lang"] = "en", }, }, table#1326 { ["itemType"] = table#1327 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1328 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1112802", }, ["subjectLabel"] = table#1329 { ["type"] = "literal", ["value"] = "A faithful interpretation of the intuitionistic propositional calculus by means of an initial segment of the Medvedev lattice", ["xml:lang"] = "en", }, }, table#1330 { ["itemType"] = table#1331 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1332 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1114401", }, ["subjectLabel"] = table#1333 { ["type"] = "literal", ["value"] = "On the power of recursive optimizers", ["xml:lang"] = "en", }, }, table#1334 { ["itemType"] = table#1335 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1336 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1114678", }, ["subjectLabel"] = table#1337 { ["type"] = "literal", ["value"] = "Bounded query classes and the difference hierarchy", ["xml:lang"] = "en", }, }, table#1338 { ["itemType"] = table#1339 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1340 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1115637", }, ["subjectLabel"] = table#1341 { ["type"] = "literal", ["value"] = "Saving the phenomena: Requirements that inductive inference machines not contradict known data", ["xml:lang"] = "en", }, }, table#1342 { ["itemType"] = table#1343 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1344 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1115863", }, ["subjectLabel"] = table#1345 { ["type"] = "literal", ["value"] = "Index sets related to prompt simplicity", ["xml:lang"] = "en", }, }, table#1346 { ["itemType"] = table#1347 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1348 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1115864", }, ["subjectLabel"] = table#1349 { ["type"] = "literal", ["value"] = "Local classes and computable indexations", ["xml:lang"] = "en", }, }, table#1350 { ["itemType"] = table#1351 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1352 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1115865", }, ["subjectLabel"] = table#1353 { ["type"] = "literal", ["value"] = "Monotone inductive definitions in a constructive theory of functions and classes", ["xml:lang"] = "en", }, }, table#1354 { ["itemType"] = table#1355 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1356 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1117039", }, ["subjectLabel"] = table#1357 { ["type"] = "literal", ["value"] = "Unsolvable algorithmic problems for semigroups, groups and rings", ["xml:lang"] = "en", }, }, table#1358 { ["itemType"] = table#1359 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1360 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1117217", }, ["subjectLabel"] = table#1361 { ["type"] = "literal", ["value"] = "Permutations and implicit definability", ["xml:lang"] = "en", }, }, table#1362 { ["itemType"] = table#1363 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1364 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1117221", }, ["subjectLabel"] = table#1365 { ["type"] = "literal", ["value"] = "The Galvin-Prikry theorem and set existence axioms", ["xml:lang"] = "en", }, }, table#1366 { ["itemType"] = table#1367 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1368 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1117699", }, ["subjectLabel"] = table#1369 { ["type"] = "literal", ["value"] = "An unpredictability approach to finite-state randomness", ["xml:lang"] = "en", }, }, table#1370 { ["itemType"] = table#1371 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1372 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1117917", }, ["subjectLabel"] = table#1373 { ["type"] = "literal", ["value"] = "Paradigms of truth detection", ["xml:lang"] = "en", }, }, table#1374 { ["itemType"] = table#1375 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1376 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1118393", }, ["subjectLabel"] = table#1377 { ["type"] = "literal", ["value"] = "Bisimulation and effectiveness", ["xml:lang"] = "en", }, }, table#1378 { ["itemType"] = table#1379 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1380 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1118578", }, ["subjectLabel"] = table#1381 { ["type"] = "literal", ["value"] = "The power of temporal proofs", ["xml:lang"] = "en", }, }, table#1382 { ["itemType"] = table#1383 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1384 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1119565", }, ["subjectLabel"] = table#1385 { ["type"] = "literal", ["value"] = "The complexity of reasoning about knowledge and time. I: Lower bounds", ["xml:lang"] = "en", }, }, table#1386 { ["itemType"] = table#1387 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1388 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1119570", }, ["subjectLabel"] = table#1389 { ["type"] = "literal", ["value"] = "Generalized computations with oracles", ["xml:lang"] = "en", }, }, table#1390 { ["itemType"] = table#1391 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1392 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1119572", }, ["subjectLabel"] = table#1393 { ["type"] = "literal", ["value"] = "Algebras with finitely approximable positively representable enrichments", ["xml:lang"] = "en", }, }, table#1394 { ["itemType"] = table#1395 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1396 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1119628", }, ["subjectLabel"] = table#1397 { ["type"] = "literal", ["value"] = "An arithmetical hierarchy in propositional dynamic logic", ["xml:lang"] = "en", }, }, table#1398 { ["itemType"] = table#1399 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1400 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1120564", }, ["subjectLabel"] = table#1401 { ["type"] = "literal", ["value"] = "Nondeterministic bounded query reducibilities", ["xml:lang"] = "en", }, }, table#1402 { ["itemType"] = table#1403 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1404 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1123589", }, ["subjectLabel"] = table#1405 { ["type"] = "literal", ["value"] = "On verifying that a concurrent program satisfies a nondeterministic specification", ["xml:lang"] = "en", }, }, table#1406 { ["itemType"] = table#1407 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1408 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1123616", }, ["subjectLabel"] = table#1409 { ["type"] = "literal", ["value"] = "Descriptive characterizations of computational complexity", ["xml:lang"] = "en", }, }, table#1410 { ["itemType"] = table#1411 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1412 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1123889", }, ["subjectLabel"] = table#1413 { ["type"] = "literal", ["value"] = "Generic copies of countable structures", ["xml:lang"] = "en", }, }, table#1414 { ["itemType"] = table#1415 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1416 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1126539", }, ["subjectLabel"] = table#1417 { ["type"] = "literal", ["value"] = "Some algorithmic problems for relatively free groups", ["xml:lang"] = "en", }, }, table#1418 { ["itemType"] = table#1419 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1420 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1127324", }, ["subjectLabel"] = table#1421 { ["type"] = "literal", ["value"] = "An improved zero-one law for algorithmically random sequences", ["xml:lang"] = "en", }, }, table#1422 { ["itemType"] = table#1423 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1424 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1127395", }, ["subjectLabel"] = table#1425 { ["type"] = "literal", ["value"] = "A notion of information related to computation", ["xml:lang"] = "en", }, }, table#1426 { ["itemType"] = table#1427 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1428 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1127532", }, ["subjectLabel"] = table#1429 { ["type"] = "literal", ["value"] = "Rudimentary relations and primitive recursion: A toolbox", ["xml:lang"] = "en", }, }, table#1430 { ["itemType"] = table#1431 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1432 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1128667", }, ["subjectLabel"] = table#1433 { ["type"] = "literal", ["value"] = "On the relative sizes of learnable sets", ["xml:lang"] = "en", }, }, table#1434 { ["itemType"] = table#1435 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1436 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1132085", }, ["subjectLabel"] = table#1437 { ["type"] = "literal", ["value"] = "\$\\mathbb{T}^\\omega\$ as a universal domain", ["xml:lang"] = "en", }, }, table#1438 { ["itemType"] = table#1439 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1440 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1132872", }, ["subjectLabel"] = table#1441 { ["type"] = "literal", ["value"] = "Data representation and computational complexity", ["xml:lang"] = "en", }, }, table#1442 { ["itemType"] = table#1443 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1444 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1135847", }, ["subjectLabel"] = table#1445 { ["type"] = "literal", ["value"] = "The first example of a recursive function which is not primitive recursive", ["xml:lang"] = "en", }, }, table#1446 { ["itemType"] = table#1447 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1448 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1137572", }, ["subjectLabel"] = table#1449 { ["type"] = "literal", ["value"] = "Effectively given domains", ["xml:lang"] = "en", }, }, table#1450 { ["itemType"] = table#1451 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1452 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1137858", }, ["subjectLabel"] = table#1453 { ["type"] = "literal", ["value"] = "Partially additive categories and flow-diagram semantics", ["xml:lang"] = "en", }, }, table#1454 { ["itemType"] = table#1455 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1456 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1137871", }, ["subjectLabel"] = table#1457 { ["type"] = "literal", ["value"] = "The subgraph homeomorphism problem", ["xml:lang"] = "en", }, }, table#1458 { ["itemType"] = table#1459 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1460 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1137992", }, ["subjectLabel"] = table#1461 { ["type"] = "literal", ["value"] = "A method for constructing maximal subalgebras of algebras of general recursive functions", ["xml:lang"] = "en", }, }, table#1462 { ["itemType"] = table#1463 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1464 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1140080", }, ["subjectLabel"] = table#1465 { ["type"] = "literal", ["value"] = "Indexings of subrecursive classes", ["xml:lang"] = "en", }, }, table#1466 { ["itemType"] = table#1467 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1468 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1140434", }, ["subjectLabel"] = table#1469 { ["type"] = "literal", ["value"] = "A logic for default reasoning", ["xml:lang"] = "en", }, }, table#1470 { ["itemType"] = table#1471 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1472 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1140632", }, ["subjectLabel"] = table#1473 { ["type"] = "literal", ["value"] = "Criterion for strong constructivizability of a homogeneous model", ["xml:lang"] = "en", }, }, table#1474 { ["itemType"] = table#1475 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1476 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1140634", }, ["subjectLabel"] = table#1477 { ["type"] = "literal", ["value"] = "Splinters and Turing degrees", ["xml:lang"] = "en", }, }, table#1478 { ["itemType"] = table#1479 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1480 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1140636", }, ["subjectLabel"] = table#1481 { ["type"] = "literal", ["value"] = "Structure of the upper semilattice of recursively enumerable m-degrees and related questions. I", ["xml:lang"] = "en", }, }, table#1482 { ["itemType"] = table#1483 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1484 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1140637", }, ["subjectLabel"] = table#1485 { ["type"] = "literal", ["value"] = "Three theorems on tt-degrees", ["xml:lang"] = "en", }, }, table#1486 { ["itemType"] = table#1487 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1488 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1142774", }, ["subjectLabel"] = table#1489 { ["type"] = "literal", ["value"] = "Strong constructivizability of homogeneous models", ["xml:lang"] = "en", }, }, table#1490 { ["itemType"] = table#1491 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1492 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1148890", }, ["subjectLabel"] = table#1493 { ["type"] = "literal", ["value"] = "The reachability problem for Petri nets and decision problems for Skolem arithmetic", ["xml:lang"] = "en", }, }, table#1494 { ["itemType"] = table#1495 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1496 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1149944", }, ["subjectLabel"] = table#1497 { ["type"] = "literal", ["value"] = "Elementary properties of free extensions", ["xml:lang"] = "en", }, }, table#1498 { ["itemType"] = table#1499 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1500 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1149947", }, ["subjectLabel"] = table#1501 { ["type"] = "literal", ["value"] = "Reducibility by Zhegalkin-linear tables", ["xml:lang"] = "en", }, }, table#1502 { ["itemType"] = table#1503 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1504 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1149948", }, ["subjectLabel"] = table#1505 { ["type"] = "literal", ["value"] = "Numerations of saturated and homogeneous models", ["xml:lang"] = "en", }, }, table#1506 { ["itemType"] = table#1507 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1508 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1150611", }, ["subjectLabel"] = table#1509 { ["type"] = "literal", ["value"] = "tt-degrees of recursively enumerable Turing degrees. II", ["xml:lang"] = "en", }, }, table#1510 { ["itemType"] = table#1511 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1512 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1150612", }, ["subjectLabel"] = table#1513 { ["type"] = "literal", ["value"] = "Structures of the degrees of unsolvability of index sets", ["xml:lang"] = "en", }, }, table#1514 { ["itemType"] = table#1515 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1516 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1151391", }, ["subjectLabel"] = table#1517 { ["type"] = "literal", ["value"] = "The logic of unboundedly reactive systems", ["xml:lang"] = "en", }, }, table#1518 { ["itemType"] = table#1519 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1520 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1151889", }, ["subjectLabel"] = table#1521 { ["type"] = "literal", ["value"] = "Research in the theory of inductive inference by GDR mathematicians - A survey", ["xml:lang"] = "en", }, }, table#1522 { ["itemType"] = table#1523 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1524 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1152214", }, ["subjectLabel"] = table#1525 { ["type"] = "literal", ["value"] = "Several results in program size complexity", ["xml:lang"] = "en", }, }, table#1526 { ["itemType"] = table#1527 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1528 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1152224", }, ["subjectLabel"] = table#1529 { ["type"] = "literal", ["value"] = "Complexity of graph embeddability problems", ["xml:lang"] = "en", }, }, table#1530 { ["itemType"] = table#1531 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1532 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1153082", }, ["subjectLabel"] = table#1533 { ["type"] = "literal", ["value"] = "Minimal determining sets of locally finitely-determined functionals", ["xml:lang"] = "en", }, }, table#1534 { ["itemType"] = table#1535 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1536 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1155049", }, ["subjectLabel"] = table#1537 { ["type"] = "literal", ["value"] = "Inductive definability: Measure and category", ["xml:lang"] = "en", }, }, table#1538 { ["itemType"] = table#1539 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1540 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1155949", }, ["subjectLabel"] = table#1541 { ["type"] = "literal", ["value"] = "The independence of control structures in abstract programming systems", ["xml:lang"] = "en", }, }, table#1542 { ["itemType"] = table#1543 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1544 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1156125", }, ["subjectLabel"] = table#1545 { ["type"] = "literal", ["value"] = "On the relation provable equivalence and on partitions in effectively inseparable sets", ["xml:lang"] = "en", }, }, table#1546 { ["itemType"] = table#1547 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1548 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1156126", }, ["subjectLabel"] = table#1549 { ["type"] = "literal", ["value"] = "Autostability of models and Abelian groups", ["xml:lang"] = "en", }, }, table#1550 { ["itemType"] = table#1551 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1552 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1156127", }, ["subjectLabel"] = table#1553 { ["type"] = "literal", ["value"] = "Autostability of models", ["xml:lang"] = "en", }, }, table#1554 { ["itemType"] = table#1555 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1556 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1156483", }, ["subjectLabel"] = table#1557 { ["type"] = "literal", ["value"] = "Remarks on recursion versus diagonalization and exponentially difficult problems", ["xml:lang"] = "en", }, }, table#1558 { ["itemType"] = table#1559 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1560 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1156791", }, ["subjectLabel"] = table#1561 { ["type"] = "literal", ["value"] = "Splitting properties and jump classes", ["xml:lang"] = "en", }, }, table#1562 { ["itemType"] = table#1563 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1564 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1156793", }, ["subjectLabel"] = table#1565 { ["type"] = "literal", ["value"] = "Recursion theory on fields and abstract dependence", ["xml:lang"] = "en", }, }, table#1566 { ["itemType"] = table#1567 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1568 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1157698", }, ["subjectLabel"] = table#1569 { ["type"] = "literal", ["value"] = "Chain properties in Pomega", ["xml:lang"] = "en", }, }, table#1570 { ["itemType"] = table#1571 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1572 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1158140", }, ["subjectLabel"] = table#1573 { ["type"] = "literal", ["value"] = "Definability in dynamic logic", ["xml:lang"] = "en", }, }, table#1574 { ["itemType"] = table#1575 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1576 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1158755", }, ["subjectLabel"] = table#1577 { ["type"] = "literal", ["value"] = "Computing with infinite objects", ["xml:lang"] = "en", }, }, table#1578 { ["itemType"] = table#1579 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1580 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1158957", }, ["subjectLabel"] = table#1581 { ["type"] = "literal", ["value"] = "Independence results in computer science?", ["xml:lang"] = "en", }, }, table#1582 { ["itemType"] = table#1583 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1584 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1159665", }, ["subjectLabel"] = table#1585 { ["type"] = "literal", ["value"] = "Analytic definability of constructive real numbers", ["xml:lang"] = "en", }, }, table#1586 { ["itemType"] = table#1587 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1588 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1161275", }, ["subjectLabel"] = table#1589 { ["type"] = "literal", ["value"] = "Two notions of correctness and their relation to testing", ["xml:lang"] = "en", }, }, table#1590 { ["itemType"] = table#1591 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1592 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1161737", }, ["subjectLabel"] = table#1593 { ["type"] = "literal", ["value"] = "Theories with three countable models", ["xml:lang"] = "en", }, }, table#1594 { ["itemType"] = table#1595 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1596 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1161742", }, ["subjectLabel"] = table#1597 { ["type"] = "literal", ["value"] = "The maximum value problem and NP real numbers", ["xml:lang"] = "en", }, }, table#1598 { ["itemType"] = table#1599 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1600 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1162811", }, ["subjectLabel"] = table#1601 { ["type"] = "literal", ["value"] = "On the structure of sets in NP and other complexity classes", ["xml:lang"] = "en", }, }, table#1602 { ["itemType"] = table#1603 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1604 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1163015", }, ["subjectLabel"] = table#1605 { ["type"] = "literal", ["value"] = "A note on natural complete sets and Goedel numberings", ["xml:lang"] = "en", }, }, table#1606 { ["itemType"] = table#1607 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1608 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1163369", }, ["subjectLabel"] = table#1609 { ["type"] = "literal", ["value"] = "Some natural structures which fail to possess a sound and decidable Hoare-like logic for their while-programs", ["xml:lang"] = "en", }, }, table#1610 { ["itemType"] = table#1611 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1612 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1164044", }, ["subjectLabel"] = table#1613 { ["type"] = "literal", ["value"] = "Construction of the m-jump", ["xml:lang"] = "en", }, }, table#1614 { ["itemType"] = table#1615 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1616 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1164625", }, ["subjectLabel"] = table#1617 { ["type"] = "literal", ["value"] = "Automorphism bases for degrees of unsolvability", ["xml:lang"] = "en", }, }, table#1618 { ["itemType"] = table#1619 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1620 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1166268", }, ["subjectLabel"] = table#1621 { ["type"] = "literal", ["value"] = "Fixed point theorems and semantics: A folk tale", ["xml:lang"] = "en", }, }, table#1622 { ["itemType"] = table#1623 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1624 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1167158", }, ["subjectLabel"] = table#1625 { ["type"] = "literal", ["value"] = "Generalized Banach-Mazur functionals in the topos of recursive sets", ["xml:lang"] = "en", }, }, table#1626 { ["itemType"] = table#1627 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1628 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1169808", }, ["subjectLabel"] = table#1629 { ["type"] = "literal", ["value"] = "Mixed computation: potential applications and problems for study", ["xml:lang"] = "en", }, }, table#1630 { ["itemType"] = table#1631 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1632 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1170187", }, ["subjectLabel"] = table#1633 { ["type"] = "literal", ["value"] = "Infimums of step-counting functions of enumeration of sets", ["xml:lang"] = "en", }, }, table#1634 { ["itemType"] = table#1635 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1636 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1171051", }, ["subjectLabel"] = table#1637 { ["type"] = "literal", ["value"] = "Structure of the m-degrees of the index sets of families of partial recursive functions", ["xml:lang"] = "en", }, }, table#1638 { ["itemType"] = table#1639 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1640 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1171052", }, ["subjectLabel"] = table#1641 { ["type"] = "literal", ["value"] = "Exact bounds of denumerable collections of degrees of difficulty", ["xml:lang"] = "en", }, }, table#1642 { ["itemType"] = table#1643 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1644 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1171053", }, ["subjectLabel"] = table#1645 { ["type"] = "literal", ["value"] = "Construction of definable degrees of constructibility", ["xml:lang"] = "en", }, }, table#1646 { ["itemType"] = table#1647 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1648 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1171056", }, ["subjectLabel"] = table#1649 { ["type"] = "literal", ["value"] = "Computational complexity of real functions", ["xml:lang"] = "en", }, }, table#1650 { ["itemType"] = table#1651 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1652 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1171511", }, ["subjectLabel"] = table#1653 { ["type"] = "literal", ["value"] = "Some undecidable determined games", ["xml:lang"] = "en", }, }, table#1654 { ["itemType"] = table#1655 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1656 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1171876", }, ["subjectLabel"] = table#1657 { ["type"] = "literal", ["value"] = "Definability by programs in first-order structures", ["xml:lang"] = "en", }, }, table#1658 { ["itemType"] = table#1659 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1660 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1176233", }, ["subjectLabel"] = table#1661 { ["type"] = "literal", ["value"] = "On sets polynomially enumerable by iteration", ["xml:lang"] = "en", }, }, table#1662 { ["itemType"] = table#1663 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1664 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1176394", }, ["subjectLabel"] = table#1665 { ["type"] = "literal", ["value"] = "Undecidability and incompleteness in classical mechanics", ["xml:lang"] = "en", }, }, table#1666 { ["itemType"] = table#1667 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1668 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1181757", }, ["subjectLabel"] = table#1669 { ["type"] = "literal", ["value"] = "On the effective content of asymptotic verifications of Edgeworth's Conjecture", ["xml:lang"] = "en", }, }, table#1670 { ["itemType"] = table#1671 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1672 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1182308", }, ["subjectLabel"] = table#1673 { ["type"] = "literal", ["value"] = "The Mapmaker's dilemma", ["xml:lang"] = "en", }, }, table#1674 { ["itemType"] = table#1675 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1676 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1182483", }, ["subjectLabel"] = table#1677 { ["type"] = "literal", ["value"] = "Uncountable degree spectra", ["xml:lang"] = "en", }, }, table#1678 { ["itemType"] = table#1679 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1680 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1183565", }, ["subjectLabel"] = table#1681 { ["type"] = "literal", ["value"] = "On p-creative sets and p-completely creative sets", ["xml:lang"] = "en", }, }, table#1682 { ["itemType"] = table#1683 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1684 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1183572", }, ["subjectLabel"] = table#1685 { ["type"] = "literal", ["value"] = "Algebraic specifiability of data types with minimal computable parameters", ["xml:lang"] = "en", }, }, table#1686 { ["itemType"] = table#1687 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1688 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1183607", }, ["subjectLabel"] = table#1689 { ["type"] = "literal", ["value"] = "Learning in the presence of partial explanations", ["xml:lang"] = "en", }, }, table#1690 { ["itemType"] = table#1691 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1692 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1184717", }, ["subjectLabel"] = table#1693 { ["type"] = "literal", ["value"] = "Sufficiency conditions for theories with recursive models", ["xml:lang"] = "en", }, }, table#1694 { ["itemType"] = table#1695 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1696 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1184732", }, ["subjectLabel"] = table#1697 { ["type"] = "literal", ["value"] = "Generic oracles, uniform machines, and codes", ["xml:lang"] = "en", }, }, table#1698 { ["itemType"] = table#1699 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1700 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1186287", }, ["subjectLabel"] = table#1701 { ["type"] = "literal", ["value"] = "Automorphisms of the lattice of recursively enumerable sets: Orbits", ["xml:lang"] = "en", }, }, table#1702 { ["itemType"] = table#1703 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1704 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1186363", }, ["subjectLabel"] = table#1705 { ["type"] = "literal", ["value"] = "Fuzzy grammars and recursively enumerable fuzzy languages", ["xml:lang"] = "en", }, }, table#1706 { ["itemType"] = table#1707 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1708 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1187022", }, ["subjectLabel"] = table#1709 { ["type"] = "literal", ["value"] = "Aggregating inductive expertise on partial recursive functions", ["xml:lang"] = "en", }, }, table#1710 { ["itemType"] = table#1711 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1712 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1187455", }, ["subjectLabel"] = table#1713 { ["type"] = "literal", ["value"] = "Fuzzy sets as named sets", ["xml:lang"] = "en", }, }, table#1714 { ["itemType"] = table#1715 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1716 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1191158", }, ["subjectLabel"] = table#1717 { ["type"] = "literal", ["value"] = "Positive algebras with congruences of finite index", ["xml:lang"] = "en", }, }, table#1718 { ["itemType"] = table#1719 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1720 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1192344", }, ["subjectLabel"] = table#1721 { ["type"] = "literal", ["value"] = "Myhill's work in recursion theory", ["xml:lang"] = "en", }, }, table#1722 { ["itemType"] = table#1723 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1724 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1192346", }, ["subjectLabel"] = table#1725 { ["type"] = "literal", ["value"] = "How complicated is the set of stable models of a recursive logic program?", ["xml:lang"] = "en", }, }, table#1726 { ["itemType"] = table#1727 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1728 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1192476", }, ["subjectLabel"] = table#1729 { ["type"] = "literal", ["value"] = "Fuzzy subsets: A constructive approach", ["xml:lang"] = "en", }, }, table#1730 { ["itemType"] = table#1731 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1732 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1193566", }, ["subjectLabel"] = table#1733 { ["type"] = "literal", ["value"] = "On the strength of König's duality theorem for infinite bipartite graphs", ["xml:lang"] = "en", }, }, table#1734 { ["itemType"] = table#1735 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1736 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1193598", }, ["subjectLabel"] = table#1737 { ["type"] = "literal", ["value"] = "Proof systems for infinite behaviours", ["xml:lang"] = "en", }, }, table#1738 { ["itemType"] = table#1739 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1740 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1193862", }, ["subjectLabel"] = table#1741 { ["type"] = "literal", ["value"] = "Fairness, distances and degrees", ["xml:lang"] = "en", }, }, table#1742 { ["itemType"] = table#1743 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1744 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1193890", }, ["subjectLabel"] = table#1745 { ["type"] = "literal", ["value"] = "Completions of perpetual logic programs", ["xml:lang"] = "en", }, }, table#1746 { ["itemType"] = table#1747 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1748 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1195860", }, ["subjectLabel"] = table#1749 { ["type"] = "literal", ["value"] = "On uniform learnability of language families", ["xml:lang"] = "en", }, }, table#1750 { ["itemType"] = table#1751 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1752 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1196205", }, ["subjectLabel"] = table#1753 { ["type"] = "literal", ["value"] = "Recursively presented games and strategies", ["xml:lang"] = "en", }, }, table#1754 { ["itemType"] = table#1755 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1756 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1196206", }, ["subjectLabel"] = table#1757 { ["type"] = "literal", ["value"] = "On Turing degrees of Walrasian models and a general impossibility result in the theory of decision-making", ["xml:lang"] = "en", }, }, table#1758 { ["itemType"] = table#1759 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1760 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1196208", }, ["subjectLabel"] = table#1761 { ["type"] = "literal", ["value"] = "Some aspects of effectively constructive mathematics that are relevant to the foundations of neoclassical mathematical economics and the theory of games", ["xml:lang"] = "en", }, }, table#1762 { ["itemType"] = table#1763 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1764 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1196345", }, ["subjectLabel"] = table#1765 { ["type"] = "literal", ["value"] = "Hamiltonian paths in infinite graphs", ["xml:lang"] = "en", }, }, table#1766 { ["itemType"] = table#1767 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1768 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1199547", }, ["subjectLabel"] = table#1769 { ["type"] = "literal", ["value"] = "Independence of the induction principle and the axiom of choice in the pure calculus of constructions", ["xml:lang"] = "en", }, }, table#1770 { ["itemType"] = table#1771 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1772 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1199822", }, ["subjectLabel"] = table#1773 { ["type"] = "literal", ["value"] = "Final algebras, cosemicomputable algebras and degrees of unsolvability", ["xml:lang"] = "en", }, }, table#1774 { ["itemType"] = table#1775 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1776 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1201287", }, ["subjectLabel"] = table#1777 { ["type"] = "literal", ["value"] = "Diagonalization, uniformity, and fixed-point theorems", ["xml:lang"] = "en", }, }, table#1778 { ["itemType"] = table#1779 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1780 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1201876", }, ["subjectLabel"] = table#1781 { ["type"] = "literal", ["value"] = "Minimum-complexity pairing functions", ["xml:lang"] = "en", }, }, table#1782 { ["itemType"] = table#1783 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1784 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1201881", }, ["subjectLabel"] = table#1785 { ["type"] = "literal", ["value"] = "Foreground automata", ["xml:lang"] = "en", }, }, table#1786 { ["itemType"] = table#1787 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1788 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1201882", }, ["subjectLabel"] = table#1789 { ["type"] = "literal", ["value"] = "Nondiamond theorems for polynomial time reducibility", ["xml:lang"] = "en", }, }, table#1790 { ["itemType"] = table#1791 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1792 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1202496", }, ["subjectLabel"] = table#1793 { ["type"] = "literal", ["value"] = "Logic, ontology, mathematical practice", ["xml:lang"] = "en", }, }, table#1794 { ["itemType"] = table#1795 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1796 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1204114", }, ["subjectLabel"] = table#1797 { ["type"] = "literal", ["value"] = "The \$n\$-rea enumeration degrees are dense", ["xml:lang"] = "en", }, }, table#1798 { ["itemType"] = table#1799 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1800 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1204706", }, ["subjectLabel"] = table#1801 { ["type"] = "literal", ["value"] = "\$E\$-hyperimmune sets", ["xml:lang"] = "en", }, }, table#1802 { ["itemType"] = table#1803 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1804 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1204738", }, ["subjectLabel"] = table#1805 { ["type"] = "literal", ["value"] = "Mal'cev's correspondence and unsolvability", ["xml:lang"] = "en", }, }, table#1806 { ["itemType"] = table#1807 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1808 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1206272", }, ["subjectLabel"] = table#1809 { ["type"] = "literal", ["value"] = "The number of algebras over simple sets", ["xml:lang"] = "en", }, }, table#1810 { ["itemType"] = table#1811 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1812 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1207542", }, ["subjectLabel"] = table#1813 { ["type"] = "literal", ["value"] = "Generalizations of enumeration reducibility using recursive infinitary propositional sentences", ["xml:lang"] = "en", }, }, table#1814 { ["itemType"] = table#1815 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1816 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1208080", }, ["subjectLabel"] = table#1817 { ["type"] = "literal", ["value"] = "Countable thin \$\\Pi^0_1\$ classes", ["xml:lang"] = "en", }, }, table#1818 { ["itemType"] = table#1819 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1820 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1209623", }, ["subjectLabel"] = table#1821 { ["type"] = "literal", ["value"] = "A new method for undecidability proofs of first order theories", ["xml:lang"] = "en", }, }, table#1822 { ["itemType"] = table#1823 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1824 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1210138", }, ["subjectLabel"] = table#1825 { ["type"] = "literal", ["value"] = "Total sets and objects in domain theory", ["xml:lang"] = "en", }, }, table#1826 { ["itemType"] = table#1827 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1828 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1210351", }, ["subjectLabel"] = table#1829 { ["type"] = "literal", ["value"] = "Some effectively infinite classes of enumerations", ["xml:lang"] = "en", }, }, table#1830 { ["itemType"] = table#1831 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1832 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1210543", }, ["subjectLabel"] = table#1833 { ["type"] = "literal", ["value"] = "On the power of inductive inference from good examples", ["xml:lang"] = "en", }, }, table#1834 { ["itemType"] = table#1835 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1836 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1212360", }, ["subjectLabel"] = table#1837 { ["type"] = "literal", ["value"] = "The extent and density of sequences within the minimal-program complexity hierarchies", ["xml:lang"] = "en", }, }, table#1838 { ["itemType"] = table#1839 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1840 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1212448", }, ["subjectLabel"] = table#1841 { ["type"] = "literal", ["value"] = "Index sets in 0'", ["xml:lang"] = "en", }, }, table#1842 { ["itemType"] = table#1843 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1844 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1212449", }, ["subjectLabel"] = table#1845 { ["type"] = "literal", ["value"] = "On different kinds of indefinite", ["xml:lang"] = "en", }, }, table#1846 { ["itemType"] = table#1847 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1848 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1212452", }, ["subjectLabel"] = table#1849 { ["type"] = "literal", ["value"] = "On computability with functionals", ["xml:lang"] = "en", }, }, table#1850 { ["itemType"] = table#1851 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1852 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1214405", }, ["subjectLabel"] = table#1853 { ["type"] = "literal", ["value"] = "Two existence theorems for computable numerations", ["xml:lang"] = "en", }, }, table#1854 { ["itemType"] = table#1855 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1856 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1214917", }, ["subjectLabel"] = table#1857 { ["type"] = "literal", ["value"] = "Approximations to the halting problem", ["xml:lang"] = "en", }, }, table#1858 { ["itemType"] = table#1859 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1860 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1214919", }, ["subjectLabel"] = table#1861 { ["type"] = "literal", ["value"] = "WCS-analysis of the context-sensitive", ["xml:lang"] = "en", }, }, table#1862 { ["itemType"] = table#1863 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1864 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1214921", }, ["subjectLabel"] = table#1865 { ["type"] = "literal", ["value"] = "Three theorems on elementary theories and tt-reducibility", ["xml:lang"] = "en", }, }, table#1866 { ["itemType"] = table#1867 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1868 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1215495", }, ["subjectLabel"] = table#1869 { ["type"] = "literal", ["value"] = "Gruppen mit vorgeschriebenem Wortproblem", ["xml:lang"] = "en", }, }, table#1870 { ["itemType"] = table#1871 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1872 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1215625", }, ["subjectLabel"] = table#1873 { ["type"] = "literal", ["value"] = "The forcing companions of number theories", ["xml:lang"] = "en", }, }, table#1874 { ["itemType"] = table#1875 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1876 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1216028", }, ["subjectLabel"] = table#1877 { ["type"] = "literal", ["value"] = "Recursive function theory and numerical analysis", ["xml:lang"] = "en", }, }, table#1878 { ["itemType"] = table#1879 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1880 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1218850", }, ["subjectLabel"] = table#1881 { ["type"] = "literal", ["value"] = "btt-reducibility", ["xml:lang"] = "en", }, }, table#1882 { ["itemType"] = table#1883 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1884 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1218851", }, ["subjectLabel"] = table#1885 { ["type"] = "literal", ["value"] = "On btt-reducibilities. II", ["xml:lang"] = "en", }, }, table#1886 { ["itemType"] = table#1887 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1888 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1218852", }, ["subjectLabel"] = table#1889 { ["type"] = "literal", ["value"] = "On complete btt-degrees", ["xml:lang"] = "en", }, }, table#1890 { ["itemType"] = table#1891 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1892 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1219561", }, ["subjectLabel"] = table#1893 { ["type"] = "literal", ["value"] = "Closure operations on measures of computational complexity", ["xml:lang"] = "en", }, }, table#1894 { ["itemType"] = table#1895 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1896 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1220391", }, ["subjectLabel"] = table#1897 { ["type"] = "literal", ["value"] = "The Turing degree of the inherent ambiguity problem for context-free languages", ["xml:lang"] = "en", }, }, table#1898 { ["itemType"] = table#1899 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1900 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1220498", }, ["subjectLabel"] = table#1901 { ["type"] = "literal", ["value"] = "A note on extending equivalence theories of algorithms", ["xml:lang"] = "en", }, }, table#1902 { ["itemType"] = table#1903 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1904 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1220921", }, ["subjectLabel"] = table#1905 { ["type"] = "literal", ["value"] = "Generalized computability and the descriptive theory of sets", ["xml:lang"] = "en", }, }, table#1906 { ["itemType"] = table#1907 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1908 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1221103", }, ["subjectLabel"] = table#1909 { ["type"] = "literal", ["value"] = "Significato e verita nell'aritmetica peaniana", ["xml:lang"] = "en", }, }, table#1910 { ["itemType"] = table#1911 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1912 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1221634", }, ["subjectLabel"] = table#1913 { ["type"] = "literal", ["value"] = "Ambiguity in the developmental systems of Lindenmayer", ["xml:lang"] = "en", }, }, table#1914 { ["itemType"] = table#1915 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1916 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1222160", }, ["subjectLabel"] = table#1917 { ["type"] = "literal", ["value"] = "Index sets of degrees of unsolvability", ["xml:lang"] = "en", }, }, table#1918 { ["itemType"] = table#1919 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1920 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1222161", }, ["subjectLabel"] = table#1921 { ["type"] = "literal", ["value"] = "Truth tabular degrees of recursively enumerable sets", ["xml:lang"] = "en", }, }, table#1922 { ["itemType"] = table#1923 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1924 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1222649", }, ["subjectLabel"] = table#1925 { ["type"] = "literal", ["value"] = "On frequency-enumerable sets", ["xml:lang"] = "en", }, }, table#1926 { ["itemType"] = table#1927 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1928 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1222721", }, ["subjectLabel"] = table#1929 { ["type"] = "literal", ["value"] = "Algebraically closed groups", ["xml:lang"] = "en", }, }, table#1930 { ["itemType"] = table#1931 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1932 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1223166", }, ["subjectLabel"] = table#1933 { ["type"] = "literal", ["value"] = "A comparison of polynomial time reducibilities", ["xml:lang"] = "en", }, }, table#1934 { ["itemType"] = table#1935 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1936 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1224091", }, ["subjectLabel"] = table#1937 { ["type"] = "literal", ["value"] = "Completely enumerated sets", ["xml:lang"] = "en", }, }, table#1938 { ["itemType"] = table#1939 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1940 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1225046", }, ["subjectLabel"] = table#1941 { ["type"] = "literal", ["value"] = "Maximal and everywhere-defined functionals", ["xml:lang"] = "en", }, }, table#1942 { ["itemType"] = table#1943 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1944 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1225613", }, ["subjectLabel"] = table#1945 { ["type"] = "literal", ["value"] = "Some properties of the constructivization of Boolean algebras", ["xml:lang"] = "en", }, }, table#1946 { ["itemType"] = table#1947 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1948 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1225932", }, ["subjectLabel"] = table#1949 { ["type"] = "literal", ["value"] = "Translational lemmas, polynomial time, and \$(\\log n)^j\$-space", ["xml:lang"] = "en", }, }, table#1950 { ["itemType"] = table#1951 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1952 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1225934", }, ["subjectLabel"] = table#1953 { ["type"] = "literal", ["value"] = "An operator embedding theorem for complexity classes of recursive functions", ["xml:lang"] = "en", }, }, table#1954 { ["itemType"] = table#1955 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1956 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1227276", }, ["subjectLabel"] = table#1957 { ["type"] = "literal", ["value"] = "Polynomial and abstract subrecursive classes", ["xml:lang"] = "en", }, }, table#1958 { ["itemType"] = table#1959 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1960 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1227730", }, ["subjectLabel"] = table#1961 { ["type"] = "literal", ["value"] = "The halt problem and theory of hierarchies", ["xml:lang"] = "en", }, }, table#1962 { ["itemType"] = table#1963 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1964 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1227731", }, ["subjectLabel"] = table#1965 { ["type"] = "literal", ["value"] = "Comparing complexity classes", ["xml:lang"] = "en", }, }, table#1966 { ["itemType"] = table#1967 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1968 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1228208", }, ["subjectLabel"] = table#1969 { ["type"] = "literal", ["value"] = "Deterministic Lindenmayer languages, nonterminals and homomorphisms", ["xml:lang"] = "en", }, }, table#1970 { ["itemType"] = table#1971 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1972 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1229713", }, ["subjectLabel"] = table#1973 { ["type"] = "literal", ["value"] = "On the density of honest subrecursive classes", ["xml:lang"] = "en", }, }, table#1974 { ["itemType"] = table#1975 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1976 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1231391", }, ["subjectLabel"] = table#1977 { ["type"] = "literal", ["value"] = "Nonexistence of program optimizers in several abstract settings", ["xml:lang"] = "en", }, }, table#1978 { ["itemType"] = table#1979 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1980 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1231485", }, ["subjectLabel"] = table#1981 { ["type"] = "literal", ["value"] = "Efficient linear orders", ["xml:lang"] = "en", }, }, table#1982 { ["itemType"] = table#1983 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1984 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1235972", }, ["subjectLabel"] = table#1985 { ["type"] = "literal", ["value"] = "Computability concepts for programming language semantics", ["xml:lang"] = "en", }, }, table#1986 { ["itemType"] = table#1987 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1988 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1235979", }, ["subjectLabel"] = table#1989 { ["type"] = "literal", ["value"] = "Techniques for separating space complexity classes", ["xml:lang"] = "en", }, }, table#1990 { ["itemType"] = table#1991 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1992 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1236109", }, ["subjectLabel"] = table#1993 { ["type"] = "literal", ["value"] = "The polynomial-time hierarchy", ["xml:lang"] = "en", }, }, table#1994 { ["itemType"] = table#1995 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#1996 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1236114", }, ["subjectLabel"] = table#1997 { ["type"] = "literal", ["value"] = "On expandability of models of Peano arithmetic. I", ["xml:lang"] = "en", }, }, table#1998 { ["itemType"] = table#1999 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2000 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1237360", }, ["subjectLabel"] = table#2001 { ["type"] = "literal", ["value"] = "Complexity-class-encoding sets", ["xml:lang"] = "en", }, }, table#2002 { ["itemType"] = table#2003 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2004 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1325710", }, ["subjectLabel"] = table#2005 { ["type"] = "literal", ["value"] = "Dynamical system where proving chaos is equivalent to proving Fermat's conjecture", ["xml:lang"] = "en", }, }, table#2006 { ["itemType"] = table#2007 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2008 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1326049", }, ["subjectLabel"] = table#2009 { ["type"] = "literal", ["value"] = "Certain properties of deducibility operators", ["xml:lang"] = "en", }, }, table#2010 { ["itemType"] = table#2011 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2012 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1237725", }, ["subjectLabel"] = table#2013 { ["type"] = "literal", ["value"] = "Non-self-equivalent constructivization of atomic Boolean algebras", ["xml:lang"] = "en", }, }, table#2014 { ["itemType"] = table#2015 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2016 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1239156", }, ["subjectLabel"] = table#2017 { ["type"] = "literal", ["value"] = "Enumerations of families of general recursive functions", ["xml:lang"] = "en", }, }, table#2018 { ["itemType"] = table#2019 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2020 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1239158", }, ["subjectLabel"] = table#2021 { ["type"] = "literal", ["value"] = "Partial degrees and \$r\$-degrees", ["xml:lang"] = "en", }, }, table#2022 { ["itemType"] = table#2023 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2024 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1240230", }, ["subjectLabel"] = table#2025 { ["type"] = "literal", ["value"] = "Two theorems on finite unions of regressive immune sets", ["xml:lang"] = "en", }, }, table#2026 { ["itemType"] = table#2027 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2028 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1241510", }, ["subjectLabel"] = table#2029 { ["type"] = "literal", ["value"] = "Das Entscheidungsproblem der Klasse von Formeln, die höchstens zwei Primformeln enthalten", ["xml:lang"] = "en", }, }, table#2030 { ["itemType"] = table#2031 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2032 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1242451", }, ["subjectLabel"] = table#2033 { ["type"] = "literal", ["value"] = "Algorithmic entropy of sets", ["xml:lang"] = "en", }, }, table#2034 { ["itemType"] = table#2035 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2036 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1242679", }, ["subjectLabel"] = table#2037 { ["type"] = "literal", ["value"] = "``Natural'' properties of flowchart step-counting measures", ["xml:lang"] = "en", }, }, table#2038 { ["itemType"] = table#2039 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2040 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1242686", }, ["subjectLabel"] = table#2041 { ["type"] = "literal", ["value"] = "Log space machines with multiple oracle tapes", ["xml:lang"] = "en", }, }, table#2042 { ["itemType"] = table#2043 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2044 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1242907", }, ["subjectLabel"] = table#2045 { ["type"] = "literal", ["value"] = "Two theorems on computable numberings", ["xml:lang"] = "en", }, }, table#2046 { ["itemType"] = table#2047 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2048 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1243504", }, ["subjectLabel"] = table#2049 { ["type"] = "literal", ["value"] = "Significance arithmetic: The probability of carrying", ["xml:lang"] = "en", }, }, table#2050 { ["itemType"] = table#2051 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2052 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1243710", }, ["subjectLabel"] = table#2053 { ["type"] = "literal", ["value"] = "Partially ordered sets of 1-degrees, contained in recursively enumerable \$m\$-degrees", ["xml:lang"] = "en", }, }, table#2054 { ["itemType"] = table#2055 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2056 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1243711", }, ["subjectLabel"] = table#2057 { ["type"] = "literal", ["value"] = "The theory of successor with an extra predicate", ["xml:lang"] = "en", }, }, table#2058 { ["itemType"] = table#2059 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2060 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1244337", }, ["subjectLabel"] = table#2061 { ["type"] = "literal", ["value"] = "On the congruence of the upper semilattices of recursively enumerable m- powers and tabular powers", ["xml:lang"] = "en", }, }, table#2062 { ["itemType"] = table#2063 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2064 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1245825", }, ["subjectLabel"] = table#2065 { ["type"] = "literal", ["value"] = "Robinson forcing is not absolute", ["xml:lang"] = "en", }, }, table#2066 { ["itemType"] = table#2067 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2068 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1245956", }, ["subjectLabel"] = table#2069 { ["type"] = "literal", ["value"] = "On the inference of optimal descriptions", ["xml:lang"] = "en", }, }, table#2070 { ["itemType"] = table#2071 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2072 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1246422", }, ["subjectLabel"] = table#2073 { ["type"] = "literal", ["value"] = "The existence of recursively enumerable minimal truth-tabular degrees", ["xml:lang"] = "en", }, }, table#2074 { ["itemType"] = table#2075 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2076 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1246423", }, ["subjectLabel"] = table#2077 { ["type"] = "literal", ["value"] = "Tabular powers of maximal sets", ["xml:lang"] = "en", }, }, table#2078 { ["itemType"] = table#2079 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2080 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1246530", }, ["subjectLabel"] = table#2081 { ["type"] = "literal", ["value"] = "Convex subsets of \$2^n\$ and bounded truth-table reducibility", ["xml:lang"] = "en", }, }, table#2082 { ["itemType"] = table#2083 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2084 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1247963", }, ["subjectLabel"] = table#2085 { ["type"] = "literal", ["value"] = "Hereditarily effective operations", ["xml:lang"] = "en", }, }, table#2086 { ["itemType"] = table#2087 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2088 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1247965", }, ["subjectLabel"] = table#2089 { ["type"] = "literal", ["value"] = "Two-element separable enumeration of sets \$\\gamma\$ with undecidable problem \$P (\\gamma,\\gamma)\$", ["xml:lang"] = "en", }, }, table#2090 { ["itemType"] = table#2091 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2092 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1248505", }, ["subjectLabel"] = table#2093 { ["type"] = "literal", ["value"] = "\$r\$-maximal major subsets", ["xml:lang"] = "en", }, }, table#2094 { ["itemType"] = table#2095 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2096 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1249569", }, ["subjectLabel"] = table#2097 { ["type"] = "literal", ["value"] = "Restricted theories of constructive Boolean algebras", ["xml:lang"] = "en", }, }, table#2098 { ["itemType"] = table#2099 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2100 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1251652", }, ["subjectLabel"] = table#2101 { ["type"] = "literal", ["value"] = "On splitting recursive sets", ["xml:lang"] = "en", }, }, table#2102 { ["itemType"] = table#2103 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2104 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1252032", }, ["subjectLabel"] = table#2105 { ["type"] = "literal", ["value"] = "Data types, abstract data types and their specification problem", ["xml:lang"] = "en", }, }, table#2106 { ["itemType"] = table#2107 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2108 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1252374", }, ["subjectLabel"] = table#2109 { ["type"] = "literal", ["value"] = "Polynomial indexing of integer lattice-points. I. General conceopts and quadratic polynomials", ["xml:lang"] = "en", }, }, table#2110 { ["itemType"] = table#2111 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2112 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1252852", }, ["subjectLabel"] = table#2113 { ["type"] = "literal", ["value"] = "On automorphisms of the degrees that preserve jumps", ["xml:lang"] = "en", }, }, table#2114 { ["itemType"] = table#2115 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2116 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1253249", }, ["subjectLabel"] = table#2117 { ["type"] = "literal", ["value"] = "The complexity of total order structures", ["xml:lang"] = "en", }, }, table#2118 { ["itemType"] = table#2119 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2120 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1253250", }, ["subjectLabel"] = table#2121 { ["type"] = "literal", ["value"] = "One class of partial sets", ["xml:lang"] = "en", }, }, table#2122 { ["itemType"] = table#2123 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2124 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1253658", }, ["subjectLabel"] = table#2125 { ["type"] = "literal", ["value"] = "A hierarchy of independent \$\\omega\$-processions of cosimple isols", ["xml:lang"] = "en", }, }, table#2126 { ["itemType"] = table#2127 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2128 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1255315", }, ["subjectLabel"] = table#2129 { ["type"] = "literal", ["value"] = "Some lowness properties and computational complexity sequences", ["xml:lang"] = "en", }, }, table#2130 { ["itemType"] = table#2131 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2132 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1255490", }, ["subjectLabel"] = table#2133 { ["type"] = "literal", ["value"] = "Arithmetical hierarchy and complexity of computation", ["xml:lang"] = "en", }, }, table#2134 { ["itemType"] = table#2135 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2136 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1255943", }, ["subjectLabel"] = table#2137 { ["type"] = "literal", ["value"] = "Constructive models of \$\\aleph_1\$-categorical theories", ["xml:lang"] = "en", }, }, table#2138 { ["itemType"] = table#2139 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2140 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1256448", }, ["subjectLabel"] = table#2141 { ["type"] = "literal", ["value"] = "Recursively enumerable bw-degrees", ["xml:lang"] = "en", }, }, table#2142 { ["itemType"] = table#2143 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2144 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1257482", }, ["subjectLabel"] = table#2145 { ["type"] = "literal", ["value"] = "The theory of empirical sequences", ["xml:lang"] = "en", }, }, table#2146 { ["itemType"] = table#2147 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2148 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1258303", }, ["subjectLabel"] = table#2149 { ["type"] = "literal", ["value"] = "Enumerations of simple models", ["xml:lang"] = "en", }, }, table#2150 { ["itemType"] = table#2151 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2152 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1258715", }, ["subjectLabel"] = table#2153 { ["type"] = "literal", ["value"] = "Model discrimination using an algorithmic information criterion", ["xml:lang"] = "en", }, }, table#2154 { ["itemType"] = table#2155 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2156 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1258733", }, ["subjectLabel"] = table#2157 { ["type"] = "literal", ["value"] = "e-powers of hyperimmune retraceable sets", ["xml:lang"] = "en", }, }, table#2158 { ["itemType"] = table#2159 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2160 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1258734", }, ["subjectLabel"] = table#2161 { ["type"] = "literal", ["value"] = "Enumeration reducibilities", ["xml:lang"] = "en", }, }, table#2162 { ["itemType"] = table#2163 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2164 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1259588", }, ["subjectLabel"] = table#2165 { ["type"] = "literal", ["value"] = "Meager and universal regressive isols", ["xml:lang"] = "en", }, }, table#2166 { ["itemType"] = table#2167 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2168 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1259592", }, ["subjectLabel"] = table#2169 { ["type"] = "literal", ["value"] = "A sequence of theories for arithmetic whose union is complete", ["xml:lang"] = "en", }, }, table#2170 { ["itemType"] = table#2171 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2172 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1262853", }, ["subjectLabel"] = table#2173 { ["type"] = "literal", ["value"] = "Independent axiomatizability of sets of sentences", ["xml:lang"] = "en", }, }, table#2174 { ["itemType"] = table#2175 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2176 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1263577", }, ["subjectLabel"] = table#2177 { ["type"] = "literal", ["value"] = "Turing L-machines and recursive computability for L-maps", ["xml:lang"] = "en", }, }, table#2178 { ["itemType"] = table#2179 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2180 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1263579", }, ["subjectLabel"] = table#2181 { ["type"] = "literal", ["value"] = "Computability by means of effectively definable schemes and definability via enumerations", ["xml:lang"] = "en", }, }, table#2182 { ["itemType"] = table#2183 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2184 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1269918", }, ["subjectLabel"] = table#2185 { ["type"] = "literal", ["value"] = "On an effective hierarchy of communicating processes: Separation principle and testing", ["xml:lang"] = "en", }, }, table#2186 { ["itemType"] = table#2187 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2188 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1271312", }, ["subjectLabel"] = table#2189 { ["type"] = "literal", ["value"] = "Investigations on measure-one identification of classes of languages", ["xml:lang"] = "en", }, }, table#2190 { ["itemType"] = table#2191 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2192 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1271464", }, ["subjectLabel"] = table#2193 { ["type"] = "literal", ["value"] = "Decidability of the finiteness of ranges of tree transductions", ["xml:lang"] = "en", }, }, table#2194 { ["itemType"] = table#2195 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2196 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1274078", }, ["subjectLabel"] = table#2197 { ["type"] = "literal", ["value"] = "Initial segments of effectively finite orders", ["xml:lang"] = "en", }, }, table#2198 { ["itemType"] = table#2199 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2200 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1274806", }, ["subjectLabel"] = table#2201 { ["type"] = "literal", ["value"] = "Achilles and the tortoise climbing up the hyper-arithmetical hierarchy", ["xml:lang"] = "en", }, }, table#2202 { ["itemType"] = table#2203 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2204 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1274807", }, ["subjectLabel"] = table#2205 { ["type"] = "literal", ["value"] = "A domain-theoretic approach to computability on the real line", ["xml:lang"] = "en", }, }, table#2206 { ["itemType"] = table#2207 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2208 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1274809", }, ["subjectLabel"] = table#2209 { ["type"] = "literal", ["value"] = "Relatively recursive reals and real functions", ["xml:lang"] = "en", }, }, table#2210 { ["itemType"] = table#2211 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2212 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1275009", }, ["subjectLabel"] = table#2213 { ["type"] = "literal", ["value"] = "Ergodic theorems for individual random sequences", ["xml:lang"] = "en", }, }, table#2214 { ["itemType"] = table#2215 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2216 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1275010", }, ["subjectLabel"] = table#2217 { ["type"] = "literal", ["value"] = "Non-stochastic infinite and finite sequences", ["xml:lang"] = "en", }, }, table#2218 { ["itemType"] = table#2219 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2220 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1277329", }, ["subjectLabel"] = table#2221 { ["type"] = "literal", ["value"] = "On interpreting Chaitin's incompleteness theorem", ["xml:lang"] = "en", }, }, table#2222 { ["itemType"] = table#2223 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2224 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1277538", }, ["subjectLabel"] = table#2225 { ["type"] = "literal", ["value"] = "Complexity properties of recursively enumerable sets and \$sQ\$-completeness", ["xml:lang"] = "en", }, }, table#2226 { ["itemType"] = table#2227 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2228 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1278041", }, ["subjectLabel"] = table#2229 { ["type"] = "literal", ["value"] = "Learning with refutation", ["xml:lang"] = "en", }, }, table#2230 { ["itemType"] = table#2231 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2232 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1282502", }, ["subjectLabel"] = table#2233 { ["type"] = "literal", ["value"] = "Recursively compressible sets", ["xml:lang"] = "en", }, }, table#2234 { ["itemType"] = table#2235 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2236 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1292398", }, ["subjectLabel"] = table#2237 { ["type"] = "literal", ["value"] = "Computability on subsets of Euclidean space. I: Closed and compact subsets", ["xml:lang"] = "en", }, }, table#2238 { ["itemType"] = table#2239 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2240 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1292403", }, ["subjectLabel"] = table#2241 { ["type"] = "literal", ["value"] = "Computable Banach spaces via domain theory", ["xml:lang"] = "en", }, }, table#2242 { ["itemType"] = table#2243 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2244 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1292404", }, ["subjectLabel"] = table#2245 { ["type"] = "literal", ["value"] = "On approximate and algebraic computability over the real numbers", ["xml:lang"] = "en", }, }, table#2246 { ["itemType"] = table#2247 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2248 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1292405", }, ["subjectLabel"] = table#2249 { ["type"] = "literal", ["value"] = "An effective Riemann Mapping Theorem", ["xml:lang"] = "en", }, }, table#2250 { ["itemType"] = table#2251 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2252 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1292407", }, ["subjectLabel"] = table#2253 { ["type"] = "literal", ["value"] = "Markov's constructive analysis; a participant's view", ["xml:lang"] = "en", }, }, table#2254 { ["itemType"] = table#2255 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2256 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1292416", }, ["subjectLabel"] = table#2257 { ["type"] = "literal", ["value"] = "Effectiveness of the global modulus of continuity on metric spaces", ["xml:lang"] = "en", }, }, table#2258 { ["itemType"] = table#2259 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2260 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1292420", }, ["subjectLabel"] = table#2261 { ["type"] = "literal", ["value"] = "Computability structure of the Sobolev spaces and its applications", ["xml:lang"] = "en", }, }, table#2262 { ["itemType"] = table#2263 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2264 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1293042", }, ["subjectLabel"] = table#2265 { ["type"] = "literal", ["value"] = "What's in a function?", ["xml:lang"] = "en", }, }, table#2266 { ["itemType"] = table#2267 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2268 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1293973", }, ["subjectLabel"] = table#2269 { ["type"] = "literal", ["value"] = "Branching in the enumeration degrees of the \$\\Sigma_2^0\$ sets", ["xml:lang"] = "en", }, }, table#2270 { ["itemType"] = table#2271 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2272 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1294100", }, ["subjectLabel"] = table#2273 { ["type"] = "literal", ["value"] = "Communication, computability, and common interest games", ["xml:lang"] = "en", }, }, table#2274 { ["itemType"] = table#2275 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2276 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1295379", }, ["subjectLabel"] = table#2277 { ["type"] = "literal", ["value"] = "What's the difference", ["xml:lang"] = "en", }, }, table#2278 { ["itemType"] = table#2279 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2280 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1295388", }, ["subjectLabel"] = table#2281 { ["type"] = "literal", ["value"] = "Approximation methods in inductive inference", ["xml:lang"] = "en", }, }, table#2282 { ["itemType"] = table#2283 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2284 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1295389", }, ["subjectLabel"] = table#2285 { ["type"] = "literal", ["value"] = "Computable isomorphisms, degree spectra of relations, and Scott families", ["xml:lang"] = "en", }, }, table#2286 { ["itemType"] = table#2287 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2288 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1295392", }, ["subjectLabel"] = table#2289 { ["type"] = "literal", ["value"] = "Point-free topological spaces, functions and recursive points; filter foundation for recursive analysis. I", ["xml:lang"] = "en", }, }, table#2290 { ["itemType"] = table#2291 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2292 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1295393", }, ["subjectLabel"] = table#2293 { ["type"] = "literal", ["value"] = "Sets of generator and automorphism bases for the enumeration degrees", ["xml:lang"] = "en", }, }, table#2294 { ["itemType"] = table#2295 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2296 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1296456", }, ["subjectLabel"] = table#2297 { ["type"] = "literal", ["value"] = "Forecasting errors and bounded rationality: An example", ["xml:lang"] = "en", }, }, table#2298 { ["itemType"] = table#2299 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2300 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1302291", }, ["subjectLabel"] = table#2301 { ["type"] = "literal", ["value"] = "Recursive and nonextendible functions over the reals; filter foundation for recursive analysis. II", ["xml:lang"] = "en", }, }, table#2302 { ["itemType"] = table#2303 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2304 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1305920", }, ["subjectLabel"] = table#2305 { ["type"] = "literal", ["value"] = "Topological queries in spatial databases", ["xml:lang"] = "en", }, }, table#2306 { ["itemType"] = table#2307 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2308 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1305936", }, ["subjectLabel"] = table#2309 { ["type"] = "literal", ["value"] = "Maximal machine learnable classes", ["xml:lang"] = "en", }, }, table#2310 { ["itemType"] = table#2311 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2312 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1311976", }, ["subjectLabel"] = table#2313 { ["type"] = "literal", ["value"] = "\$\\Pi_ 1^ 1\$-universality of some propositional logics of concurrent programs", ["xml:lang"] = "en", }, }, table#2314 { ["itemType"] = table#2315 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2316 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1314345", }, ["subjectLabel"] = table#2317 { ["type"] = "literal", ["value"] = "Constructive proofs of the range property in lambda calculus", ["xml:lang"] = "en", }, }, table#2318 { ["itemType"] = table#2319 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2320 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1314348", }, ["subjectLabel"] = table#2321 { ["type"] = "literal", ["value"] = "Computational foundations of basic recursive function theory", ["xml:lang"] = "en", }, }, table#2322 { ["itemType"] = table#2323 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2324 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1314361", }, ["subjectLabel"] = table#2325 { ["type"] = "literal", ["value"] = "Set-theoretical and other elementary models of the \$\\lambda\$-calculus", ["xml:lang"] = "en", }, }, table#2326 { ["itemType"] = table#2327 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2328 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1314366", }, ["subjectLabel"] = table#2329 { ["type"] = "literal", ["value"] = "Composition is almost (but not quite) as good as \$s-1-1\$", ["xml:lang"] = "en", }, }, table#2330 { ["itemType"] = table#2331 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2332 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1314544", }, ["subjectLabel"] = table#2333 { ["type"] = "literal", ["value"] = "Splitting theorems in recursion theory", ["xml:lang"] = "en", }, }, table#2334 { ["itemType"] = table#2335 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2336 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1315834", }, ["subjectLabel"] = table#2337 { ["type"] = "literal", ["value"] = "Hyperarithmetical relations in expansions of recursive structures", ["xml:lang"] = "en", }, }, table#2338 { ["itemType"] = table#2339 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2340 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1317601", }, ["subjectLabel"] = table#2341 { ["type"] = "literal", ["value"] = "Effective choice for relations and reducibilities in classes of constructive and positive models", ["xml:lang"] = "en", }, }, table#2342 { ["itemType"] = table#2343 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2344 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1317603", }, ["subjectLabel"] = table#2345 { ["type"] = "literal", ["value"] = "Homomorphisms onto negative algebras", ["xml:lang"] = "en", }, }, table#2346 { ["itemType"] = table#2347 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2348 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1317606", }, ["subjectLabel"] = table#2349 { ["type"] = "literal", ["value"] = "Primitive Jordan algebras", ["xml:lang"] = "en", }, }, table#2350 { ["itemType"] = table#2351 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2352 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1317609", }, ["subjectLabel"] = table#2353 { ["type"] = "literal", ["value"] = "Finitely generated groups with the M. Hall property", ["xml:lang"] = "en", }, }, table#2354 { ["itemType"] = table#2355 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2356 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1317613", }, ["subjectLabel"] = table#2357 { ["type"] = "literal", ["value"] = "The concept of a binary relation over partial enumerated sets", ["xml:lang"] = "en", }, }, table#2358 { ["itemType"] = table#2359 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2360 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1317617", }, ["subjectLabel"] = table#2361 { ["type"] = "literal", ["value"] = "Locally finite simple groups as a product of two inert subgroups", ["xml:lang"] = "en", }, }, table#2362 { ["itemType"] = table#2363 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2364 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1317618", }, ["subjectLabel"] = table#2365 { ["type"] = "literal", ["value"] = "Local characterizations of infinite alternating and Lie type groups", ["xml:lang"] = "en", }, }, table#2366 { ["itemType"] = table#2367 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2368 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1317619", }, ["subjectLabel"] = table#2369 { ["type"] = "literal", ["value"] = "A semiorthogonal sum of monocomposition algebras with unity", ["xml:lang"] = "en", }, }, table#2370 { ["itemType"] = table#2371 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2372 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1317621", }, ["subjectLabel"] = table#2373 { ["type"] = "literal", ["value"] = "A finitary realizable list of properties", ["xml:lang"] = "en", }, }, table#2374 { ["itemType"] = table#2375 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2376 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1317622", }, ["subjectLabel"] = table#2377 { ["type"] = "literal", ["value"] = "Admissible sets in group theory", ["xml:lang"] = "en", }, }, table#2378 { ["itemType"] = table#2379 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2380 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1317634", }, ["subjectLabel"] = table#2381 { ["type"] = "literal", ["value"] = "Superdecomposable pure injective modules over commutative valuation rings", ["xml:lang"] = "en", }, }, table#2382 { ["itemType"] = table#2383 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2384 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1318473", }, ["subjectLabel"] = table#2385 { ["type"] = "literal", ["value"] = "Gap-definable counting classes", ["xml:lang"] = "en", }, }, table#2386 { ["itemType"] = table#2387 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2388 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1319364", }, ["subjectLabel"] = table#2389 { ["type"] = "literal", ["value"] = "Recursive versus recursively enumerable binary relations", ["xml:lang"] = "en", }, }, table#2390 { ["itemType"] = table#2391 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2392 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1322161", }, ["subjectLabel"] = table#2393 { ["type"] = "literal", ["value"] = "Proving partial order properties", ["xml:lang"] = "en", }, }, table#2394 { ["itemType"] = table#2395 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2396 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1322162", }, ["subjectLabel"] = table#2397 { ["type"] = "literal", ["value"] = "A theory of timed automata", ["xml:lang"] = "en", }, }, table#2398 { ["itemType"] = table#2399 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2400 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1323362", }, ["subjectLabel"] = table#2401 { ["type"] = "literal", ["value"] = "Logical and schematic characterization of complexity classes", ["xml:lang"] = "en", }, }, table#2402 { ["itemType"] = table#2403 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2404 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1612486", }, ["subjectLabel"] = table#2405 { ["type"] = "literal", ["value"] = "Abstract complexity theory and the \$\\Delta_{2}^{0}\$ degrees", ["xml:lang"] = "en", }, }, table#2406 { ["itemType"] = table#2407 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2408 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1326768", }, ["subjectLabel"] = table#2409 { ["type"] = "literal", ["value"] = "Inseparability in recursive copies", ["xml:lang"] = "en", }, }, table#2410 { ["itemType"] = table#2411 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2412 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1326776", }, ["subjectLabel"] = table#2413 { ["type"] = "literal", ["value"] = "On speedable and levelable vector spaces", ["xml:lang"] = "en", }, }, table#2414 { ["itemType"] = table#2415 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2416 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1326781", }, ["subjectLabel"] = table#2417 { ["type"] = "literal", ["value"] = "Recursive unary algebras and trees", ["xml:lang"] = "en", }, }, table#2418 { ["itemType"] = table#2419 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2420 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1328399", }, ["subjectLabel"] = table#2421 { ["type"] = "literal", ["value"] = "Kolmogorov complexity arguments in combinatorics", ["xml:lang"] = "en", }, }, table#2422 { ["itemType"] = table#2423 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2424 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1328888", }, ["subjectLabel"] = table#2425 { ["type"] = "literal", ["value"] = "Some descriptive-set-theoretical problems in complexity theory", ["xml:lang"] = "en", }, }, table#2426 { ["itemType"] = table#2427 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2428 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1617623", }, ["subjectLabel"] = table#2429 { ["type"] = "literal", ["value"] = "A computable expression of closure to efficient causation", ["xml:lang"] = "en", }, }, table#2430 { ["itemType"] = table#2431 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2432 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1617982", }, ["subjectLabel"] = table#2433 { ["type"] = "literal", ["value"] = "Positive presentations of families relative to \$e\$-oracles", ["xml:lang"] = "en", }, }, table#2434 { ["itemType"] = table#2435 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2436 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1331919", }, ["subjectLabel"] = table#2437 { ["type"] = "literal", ["value"] = "Gödel's incompleteness theorem", ["xml:lang"] = "en", }, }, table#2438 { ["itemType"] = table#2439 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2440 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1331945", }, ["subjectLabel"] = table#2441 { ["type"] = "literal", ["value"] = "On the solvability of domino snake problems", ["xml:lang"] = "en", }, }, table#2442 { ["itemType"] = table#2443 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2444 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1620777", }, ["subjectLabel"] = table#2445 { ["type"] = "literal", ["value"] = "Degrees of autostability for prime Boolean algebras", ["xml:lang"] = "en", }, }, table#2446 { ["itemType"] = table#2447 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2448 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1333402", }, ["subjectLabel"] = table#2449 { ["type"] = "literal", ["value"] = "Characterizing language identification by standardizing operations", ["xml:lang"] = "en", }, }, table#2450 { ["itemType"] = table#2451 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2452 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1334655", }, ["subjectLabel"] = table#2453 { ["type"] = "literal", ["value"] = "Computational depth and reducibility", ["xml:lang"] = "en", }, }, table#2454 { ["itemType"] = table#2455 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2456 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1337694", }, ["subjectLabel"] = table#2457 { ["type"] = "literal", ["value"] = "Progress measures, immediate determinacy, and a subset construction for tree automata", ["xml:lang"] = "en", }, }, table#2458 { ["itemType"] = table#2459 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2460 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1338895", }, ["subjectLabel"] = table#2461 { ["type"] = "literal", ["value"] = "On problems with short certificates", ["xml:lang"] = "en", }, }, table#2462 { ["itemType"] = table#2463 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2464 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1341316", }, ["subjectLabel"] = table#2465 { ["type"] = "literal", ["value"] = "The structure of the honest polynomial m-degrees", ["xml:lang"] = "en", }, }, table#2466 { ["itemType"] = table#2467 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2468 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1344854", }, ["subjectLabel"] = table#2469 { ["type"] = "literal", ["value"] = "On the danger of half-truths", ["xml:lang"] = "en", }, }, table#2470 { ["itemType"] = table#2471 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2472 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1346246", }, ["subjectLabel"] = table#2473 { ["type"] = "literal", ["value"] = "Power set recursion", ["xml:lang"] = "en", }, }, table#2474 { ["itemType"] = table#2475 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2476 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1346911", }, ["subjectLabel"] = table#2477 { ["type"] = "literal", ["value"] = "Generalized computations with binary oracles", ["xml:lang"] = "en", }, }, table#2478 { ["itemType"] = table#2479 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2480 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1349859", }, ["subjectLabel"] = table#2481 { ["type"] = "literal", ["value"] = "Small universal register machines", ["xml:lang"] = "en", }, }, table#2482 { ["itemType"] = table#2483 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2484 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1351164", }, ["subjectLabel"] = table#2485 { ["type"] = "literal", ["value"] = "On proving that a graph has no large clique: A connection with Ramsey theory", ["xml:lang"] = "en", }, }, table#2486 { ["itemType"] = table#2487 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2488 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1351959", }, ["subjectLabel"] = table#2489 { ["type"] = "literal", ["value"] = "Learning in the presence of inaccurate information", ["xml:lang"] = "en", }, }, table#2490 { ["itemType"] = table#2491 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2492 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1356221", }, ["subjectLabel"] = table#2493 { ["type"] = "literal", ["value"] = "A theory of nonmonotonic rule systems I", ["xml:lang"] = "en", }, }, table#2494 { ["itemType"] = table#2495 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2496 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1362333", }, ["subjectLabel"] = table#2497 { ["type"] = "literal", ["value"] = "The isomorphism conjecture holds and one-way functions exist relative to an oracle", ["xml:lang"] = "en", }, }, table#2498 { ["itemType"] = table#2499 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2500 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1362334", }, ["subjectLabel"] = table#2501 { ["type"] = "literal", ["value"] = "Semantics vs syntax vs computations: Machine models for type-2 polynomial-time bounded functionals", ["xml:lang"] = "en", }, }, table#2502 { ["itemType"] = table#2503 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2504 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1365246", }, ["subjectLabel"] = table#2505 { ["type"] = "literal", ["value"] = "Permitting, forcing, and copying of a given recursive relation", ["xml:lang"] = "en", }, }, table#2506 { ["itemType"] = table#2507 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2508 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1366536", }, ["subjectLabel"] = table#2509 { ["type"] = "literal", ["value"] = "Index sets and presentations of complexity classes", ["xml:lang"] = "en", }, }, table#2510 { ["itemType"] = table#2511 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2512 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1367526", }, ["subjectLabel"] = table#2513 { ["type"] = "literal", ["value"] = "On aggregating teams of learning machines", ["xml:lang"] = "en", }, }, table#2514 { ["itemType"] = table#2515 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2516 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1370522", }, ["subjectLabel"] = table#2517 { ["type"] = "literal", ["value"] = "A formal specification of document processing", ["xml:lang"] = "en", }, }, table#2518 { ["itemType"] = table#2519 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2520 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1374213", }, ["subjectLabel"] = table#2521 { ["type"] = "literal", ["value"] = "Higman's embedding theorem in a general setting and its application to existentially closed algebras", ["xml:lang"] = "en", }, }, table#2522 { ["itemType"] = table#2523 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2524 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1380421", }, ["subjectLabel"] = table#2525 { ["type"] = "literal", ["value"] = "Learning-theoretic perspectives of acceptable numberings", ["xml:lang"] = "en", }, }, table#2526 { ["itemType"] = table#2527 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2528 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1673673", }, ["subjectLabel"] = table#2529 { ["type"] = "literal", ["value"] = "A computably enumerable partial ordering without computably enumerable maximal chains and antichains", ["xml:lang"] = "en", }, }, table#2530 { ["itemType"] = table#2531 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2532 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1674868", }, ["subjectLabel"] = table#2533 { ["type"] = "literal", ["value"] = "A theory of formal synthesis via inductive learning", ["xml:lang"] = "en", }, }, table#2534 { ["itemType"] = table#2535 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2536 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1382180", }, ["subjectLabel"] = table#2537 { ["type"] = "literal", ["value"] = "Randnomness, computability, and algebraic specifications", ["xml:lang"] = "en", }, }, table#2538 { ["itemType"] = table#2539 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2540 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1676359", }, ["subjectLabel"] = table#2541 { ["type"] = "literal", ["value"] = "Circuit satisfiability and constraint satisfaction around Skolem arithmetic", ["xml:lang"] = "en", }, }, table#2542 { ["itemType"] = table#2543 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2544 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1389656", }, ["subjectLabel"] = table#2545 { ["type"] = "literal", ["value"] = "Kolmogorov numberings and minimal identification", ["xml:lang"] = "en", }, }, table#2546 { ["itemType"] = table#2547 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2548 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1683373", }, ["subjectLabel"] = table#2549 { ["type"] = "literal", ["value"] = "On fixed-point theorems in synthetic computability", ["xml:lang"] = "en", }, }, table#2550 { ["itemType"] = table#2551 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2552 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1391302", }, ["subjectLabel"] = table#2553 { ["type"] = "literal", ["value"] = "Binary search and recursive graph problems", ["xml:lang"] = "en", }, }, table#2554 { ["itemType"] = table#2555 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2556 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1391865", }, ["subjectLabel"] = table#2557 { ["type"] = "literal", ["value"] = "Abstract fairness and semantics", ["xml:lang"] = "en", }, }, table#2558 { ["itemType"] = table#2559 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2560 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1392019", }, ["subjectLabel"] = table#2561 { ["type"] = "literal", ["value"] = "Universality of the chip-firing game", ["xml:lang"] = "en", }, }, table#2562 { ["itemType"] = table#2563 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2564 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1392280", }, ["subjectLabel"] = table#2565 { ["type"] = "literal", ["value"] = "Monadic logic programs and functional complexity", ["xml:lang"] = "en", }, }, table#2566 { ["itemType"] = table#2567 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2568 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1393225", }, ["subjectLabel"] = table#2569 { ["type"] = "literal", ["value"] = "Positive equivalences", ["xml:lang"] = "en", }, }, table#2570 { ["itemType"] = table#2571 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2572 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1394222", }, ["subjectLabel"] = table#2573 { ["type"] = "literal", ["value"] = "Upward closure and cohesive degrees", ["xml:lang"] = "en", }, }, table#2574 { ["itemType"] = table#2575 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2576 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1688648", }, ["subjectLabel"] = table#2577 { ["type"] = "literal", ["value"] = "Computable torsion abelian groups", ["xml:lang"] = "en", }, }, table#2578 { ["itemType"] = table#2579 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2580 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1688713", }, ["subjectLabel"] = table#2581 { ["type"] = "literal", ["value"] = "The never-ending recursion", ["xml:lang"] = "en", }, }, table#2582 { ["itemType"] = table#2583 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2584 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1688969", }, ["subjectLabel"] = table#2585 { ["type"] = "literal", ["value"] = "Fixed points in lambda calculus. an eccentric survey of problems and solutions", ["xml:lang"] = "en", }, }, table#2586 { ["itemType"] = table#2587 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2588 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1398370", }, ["subjectLabel"] = table#2589 { ["type"] = "literal", ["value"] = "On the intrinsic complexity of learning recursive functions", ["xml:lang"] = "en", }, }, table#2590 { ["itemType"] = table#2591 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2592 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1399975", }, ["subjectLabel"] = table#2593 { ["type"] = "literal", ["value"] = "Decidability results for primitive recursive algorithms", ["xml:lang"] = "en", }, }, table#2594 { ["itemType"] = table#2595 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2596 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1693042", }, ["subjectLabel"] = table#2597 { ["type"] = "literal", ["value"] = "Jumps of computably enumerable equivalence relations", ["xml:lang"] = "en", }, }, table#2598 { ["itemType"] = table#2599 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2600 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1401165", }, ["subjectLabel"] = table#2601 { ["type"] = "literal", ["value"] = "Borel hierarchy and omega context free languages.", ["xml:lang"] = "en", }, }, table#2602 { ["itemType"] = table#2603 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2604 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1401340", }, ["subjectLabel"] = table#2605 { ["type"] = "literal", ["value"] = "P-immune sets with holes lack self-reducibility properties.", ["xml:lang"] = "en", }, }, table#2606 { ["itemType"] = table#2607 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2608 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1693999", }, ["subjectLabel"] = table#2609 { ["type"] = "literal", ["value"] = "On the information carried by programs about the objects they compute", ["xml:lang"] = "en", }, }, table#2610 { ["itemType"] = table#2611 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2612 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1694008", }, ["subjectLabel"] = table#2613 { ["type"] = "literal", ["value"] = "A generalized characterization of algorithmic probability", ["xml:lang"] = "en", }, }, table#2614 { ["itemType"] = table#2615 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2616 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1401925", }, ["subjectLabel"] = table#2617 { ["type"] = "literal", ["value"] = "Random elements in effective topological spaces with measure.", ["xml:lang"] = "en", }, }, table#2618 { ["itemType"] = table#2619 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2620 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1697984", }, ["subjectLabel"] = table#2621 { ["type"] = "literal", ["value"] = "Fuzzy Turing machines: normal form and limitative theorems", ["xml:lang"] = "en", }, }, table#2622 { ["itemType"] = table#2623 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2624 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1408859", }, ["subjectLabel"] = table#2625 { ["type"] = "literal", ["value"] = "Homomorphisms and quotients of degree structures", ["xml:lang"] = "en", }, }, table#2626 { ["itemType"] = table#2627 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2628 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1702719", }, ["subjectLabel"] = table#2629 { ["type"] = "literal", ["value"] = "Tarski-type problems for free associative algebras", ["xml:lang"] = "en", }, }, table#2630 { ["itemType"] = table#2631 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2632 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1412834", }, ["subjectLabel"] = table#2633 { ["type"] = "literal", ["value"] = "A blend of methods of recursion theory and topology.", ["xml:lang"] = "en", }, }, table#2634 { ["itemType"] = table#2635 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2636 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1709682", }, ["subjectLabel"] = table#2637 { ["type"] = "literal", ["value"] = "What does a group algebra of a free group ``know'' about the group?", ["xml:lang"] = "en", }, }, table#2638 { ["itemType"] = table#2639 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2640 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1712495", }, ["subjectLabel"] = table#2641 { ["type"] = "literal", ["value"] = "The \$\\mathbf{M}\$-computations induced by accessibility relations in nonstandard models \$\\mathbf{M}\$ of Hoare logic", ["xml:lang"] = "en", }, }, table#2642 { ["itemType"] = table#2643 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2644 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1713478", }, ["subjectLabel"] = table#2645 { ["type"] = "literal", ["value"] = "Recursion-theoretic ranking and compression", ["xml:lang"] = "en", }, }, table#2646 { ["itemType"] = table#2647 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2648 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1425651", }, ["subjectLabel"] = table#2649 { ["type"] = "literal", ["value"] = "Computability-theoretic and proof-theoretic aspects of partial and linear orderings", ["xml:lang"] = "en", }, }, table#2650 { ["itemType"] = table#2651 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2652 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1426008", }, ["subjectLabel"] = table#2653 { ["type"] = "literal", ["value"] = "Some connections between bounded query classes and non-uniform complexity.", ["xml:lang"] = "en", }, }, table#2654 { ["itemType"] = table#2655 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2656 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1426149", }, ["subjectLabel"] = table#2657 { ["type"] = "literal", ["value"] = "Learning how to separate.", ["xml:lang"] = "en", }, }, table#2658 { ["itemType"] = table#2659 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2660 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1426150", }, ["subjectLabel"] = table#2661 { ["type"] = "literal", ["value"] = "Separation of uniform learning classes.", ["xml:lang"] = "en", }, }, table#2662 { ["itemType"] = table#2663 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2664 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1426440", }, ["subjectLabel"] = table#2665 { ["type"] = "literal", ["value"] = "Watson-Crick D0L systems: Generative power and undecidable problems.", ["xml:lang"] = "en", }, }, table#2666 { ["itemType"] = table#2667 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2668 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1427864", }, ["subjectLabel"] = table#2669 { ["type"] = "literal", ["value"] = "Learning by switching type of information.", ["xml:lang"] = "en", }, }, table#2670 { ["itemType"] = table#2671 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2672 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1434367", }, ["subjectLabel"] = table#2673 { ["type"] = "literal", ["value"] = "Algorithmic complexity of recursive and inductive algorithms", ["xml:lang"] = "en", }, }, table#2674 { ["itemType"] = table#2675 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2676 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1434368", }, ["subjectLabel"] = table#2677 { ["type"] = "literal", ["value"] = "Characterizing the super-Turing computing power and efficiency of classical fuzzy Turing machines", ["xml:lang"] = "en", }, }, table#2678 { ["itemType"] = table#2679 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2680 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1434369", }, ["subjectLabel"] = table#2681 { ["type"] = "literal", ["value"] = "Experience, generations, and limits in machine learning", ["xml:lang"] = "en", }, }, table#2682 { ["itemType"] = table#2683 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2684 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1733103", }, ["subjectLabel"] = table#2685 { ["type"] = "literal", ["value"] = "On the hardness of analyzing probabilistic programs", ["xml:lang"] = "en", }, }, table#2686 { ["itemType"] = table#2687 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2688 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1734277", }, ["subjectLabel"] = table#2689 { ["type"] = "literal", ["value"] = "Elementary theories and hereditary undecidability for semilattices of numberings", ["xml:lang"] = "en", }, }, table#2690 { ["itemType"] = table#2691 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2692 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1756497", }, ["subjectLabel"] = table#2693 { ["type"] = "literal", ["value"] = "Hanf number for Scott sentences of computable structures", ["xml:lang"] = "en", }, }, table#2694 { ["itemType"] = table#2695 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2696 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1757652", }, ["subjectLabel"] = table#2697 { ["type"] = "literal", ["value"] = "Turing degrees in refinements of the arithmetical hierarchy", ["xml:lang"] = "en", }, }, table#2698 { ["itemType"] = table#2699 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2700 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1761697", }, ["subjectLabel"] = table#2701 { ["type"] = "literal", ["value"] = "Quantum value indefiniteness", ["xml:lang"] = "en", }, }, table#2702 { ["itemType"] = table#2703 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2704 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1762734", }, ["subjectLabel"] = table#2705 { ["type"] = "literal", ["value"] = "A blend of methods of recursion theory and topology: a \$\\Pi_1^0\$ tree of shadow points", ["xml:lang"] = "en", }, }, table#2706 { ["itemType"] = table#2707 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2708 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1765159", }, ["subjectLabel"] = table#2709 { ["type"] = "literal", ["value"] = "A Banach-Mazur computable but not Markov computable function on the computable real numbers", ["xml:lang"] = "en", }, }, table#2710 { ["itemType"] = table#2711 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2712 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1776400", }, ["subjectLabel"] = table#2713 { ["type"] = "literal", ["value"] = "Weakly useful sequences", ["xml:lang"] = "en", }, }, table#2714 { ["itemType"] = table#2715 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2716 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1779561", }, ["subjectLabel"] = table#2717 { ["type"] = "literal", ["value"] = "The constructive reals as a Java library", ["xml:lang"] = "en", }, }, table#2718 { ["itemType"] = table#2719 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2720 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1780449", }, ["subjectLabel"] = table#2721 { ["type"] = "literal", ["value"] = "Increasing the power of uniform inductive learners", ["xml:lang"] = "en", }, }, table#2722 { ["itemType"] = table#2723 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2724 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1780450", }, ["subjectLabel"] = table#2725 { ["type"] = "literal", ["value"] = "Predictive complexity and information", ["xml:lang"] = "en", }, }, table#2726 { ["itemType"] = table#2727 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2728 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1784963", }, ["subjectLabel"] = table#2729 { ["type"] = "literal", ["value"] = "Multi-buffer simulations: decidability and complexity", ["xml:lang"] = "en", }, }, table#2730 { ["itemType"] = table#2731 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2732 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1787951", }, ["subjectLabel"] = table#2733 { ["type"] = "literal", ["value"] = "Bounded Turing reductions and data processing inequalities for sequences", ["xml:lang"] = "en", }, }, table#2734 { ["itemType"] = table#2735 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2736 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1797917", }, ["subjectLabel"] = table#2737 { ["type"] = "literal", ["value"] = "Particle state change algorithm", ["xml:lang"] = "en", }, }, table#2738 { ["itemType"] = table#2739 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2740 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1803012", }, ["subjectLabel"] = table#2741 { ["type"] = "literal", ["value"] = "Models of arithmetic in \$A\$-isols", ["xml:lang"] = "en", }, }, table#2742 { ["itemType"] = table#2743 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2744 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1567396", }, ["subjectLabel"] = table#2745 { ["type"] = "literal", ["value"] = "Robust learning aided by context", ["xml:lang"] = "en", }, }, table#2746 { ["itemType"] = table#2747 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2748 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1568759", }, ["subjectLabel"] = table#2749 { ["type"] = "literal", ["value"] = "Quasi-minimal enumeration degrees and minimal Turing degrees", ["xml:lang"] = "en", }, }, table#2750 { ["itemType"] = table#2751 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2752 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1575464", }, ["subjectLabel"] = table#2753 { ["type"] = "literal", ["value"] = "Learning languages and functions by erasing", ["xml:lang"] = "en", }, }, table#2754 { ["itemType"] = table#2755 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2756 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1575670", }, ["subjectLabel"] = table#2757 { ["type"] = "literal", ["value"] = "Computability on continuous, lower semi-continuous and upper semi-continuous real functions", ["xml:lang"] = "en", }, }, table#2758 { ["itemType"] = table#2759 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2760 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1575716", }, ["subjectLabel"] = table#2761 { ["type"] = "literal", ["value"] = "A second step towards complexity-theoretic analogs of Rice's Theorem", ["xml:lang"] = "en", }, }, table#2762 { ["itemType"] = table#2763 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2764 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1575840", }, ["subjectLabel"] = table#2765 { ["type"] = "literal", ["value"] = "Ordinal mind change complexity of language identification", ["xml:lang"] = "en", }, }, table#2766 { ["itemType"] = table#2767 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2768 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1586994", }, ["subjectLabel"] = table#2769 { ["type"] = "literal", ["value"] = "\$e\$-immune sets", ["xml:lang"] = "en", }, }, table#2770 { ["itemType"] = table#2771 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2772 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1589483", }, ["subjectLabel"] = table#2773 { ["type"] = "literal", ["value"] = "\$L(A)=L(B)\$? decidability results from complete formal systems", ["xml:lang"] = "en", }, }, table#2774 { ["itemType"] = table#2775 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2776 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1599549", }, ["subjectLabel"] = table#2777 { ["type"] = "literal", ["value"] = "Predicting zero coefficients in formal power series computations.", ["xml:lang"] = "en", }, }, table#2778 { ["itemType"] = table#2779 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2780 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1603595", }, ["subjectLabel"] = table#2781 { ["type"] = "literal", ["value"] = "Mind change complexity of learning logic programs", ["xml:lang"] = "en", }, }, table#2782 { ["itemType"] = table#2783 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2784 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1603699", }, ["subjectLabel"] = table#2785 { ["type"] = "literal", ["value"] = "Modelization of deterministic rational relations", ["xml:lang"] = "en", }, }, table#2786 { ["itemType"] = table#2787 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2788 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1604194", }, ["subjectLabel"] = table#2789 { ["type"] = "literal", ["value"] = "Language learning from texts: Degrees of intrinsic complexity and their characterizations", ["xml:lang"] = "en", }, }, table#2790 { ["itemType"] = table#2791 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2792 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1607219", }, ["subjectLabel"] = table#2793 { ["type"] = "literal", ["value"] = "\$\\forall \\exists^{5}\$-equational theory of context unification is undecidable", ["xml:lang"] = "en", }, }, table#2794 { ["itemType"] = table#2795 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2796 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1607294", }, ["subjectLabel"] = table#2797 { ["type"] = "literal", ["value"] = "Effective metric spaces and representations of the reals.", ["xml:lang"] = "en", }, }, table#2798 { ["itemType"] = table#2799 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2800 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1607296", }, ["subjectLabel"] = table#2801 { ["type"] = "literal", ["value"] = "Effective simultaneous approximability of reals.", ["xml:lang"] = "en", }, }, table#2802 { ["itemType"] = table#2803 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2804 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1874228", }, ["subjectLabel"] = table#2805 { ["type"] = "literal", ["value"] = "Advanced elementary formal systems.", ["xml:lang"] = "en", }, }, table#2806 { ["itemType"] = table#2807 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2808 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1874229", }, ["subjectLabel"] = table#2809 { ["type"] = "literal", ["value"] = "Decision lists over regular patterns.", ["xml:lang"] = "en", }, }, table#2810 { ["itemType"] = table#2811 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2812 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1874230", }, ["subjectLabel"] = table#2813 { ["type"] = "literal", ["value"] = "Refutable language learning with a neighbor system.", ["xml:lang"] = "en", }, }, table#2814 { ["itemType"] = table#2815 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2816 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1874231", }, ["subjectLabel"] = table#2817 { ["type"] = "literal", ["value"] = "On learning of functions refutably.", ["xml:lang"] = "en", }, }, table#2818 { ["itemType"] = table#2819 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2820 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1874242", }, ["subjectLabel"] = table#2821 { ["type"] = "literal", ["value"] = "On the expressiveness of choice quantification", ["xml:lang"] = "en", }, }, table#2822 { ["itemType"] = table#2823 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2824 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1877692", }, ["subjectLabel"] = table#2825 { ["type"] = "literal", ["value"] = "Automatic graphs and D0L-sequences of finite graphs", ["xml:lang"] = "en", }, }, table#2826 { ["itemType"] = table#2827 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2828 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1877693", }, ["subjectLabel"] = table#2829 { ["type"] = "literal", ["value"] = "Intrinsic complexity of learning geometrical concepts from positive data", ["xml:lang"] = "en", }, }, table#2830 { ["itemType"] = table#2831 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2832 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1880777", }, ["subjectLabel"] = table#2833 { ["type"] = "literal", ["value"] = "Robust learning -- rich and poor", ["xml:lang"] = "en", }, }, table#2834 { ["itemType"] = table#2835 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2836 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1885034", }, ["subjectLabel"] = table#2837 { ["type"] = "literal", ["value"] = "Recursion and topology on \$2^{\\leq\\omega}\$ for possibly infinite computations", ["xml:lang"] = "en", }, }, table#2838 { ["itemType"] = table#2839 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2840 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1887139", }, ["subjectLabel"] = table#2841 { ["type"] = "literal", ["value"] = "The dimensions of individual strings and sequences", ["xml:lang"] = "en", }, }, table#2842 { ["itemType"] = table#2843 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2844 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1891248", }, ["subjectLabel"] = table#2845 { ["type"] = "literal", ["value"] = "Enumerators of lambda terms are reducing constructively", ["xml:lang"] = "en", }, }, table#2846 { ["itemType"] = table#2847 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2848 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1891667", }, ["subjectLabel"] = table#2849 { ["type"] = "literal", ["value"] = "On the difficulty of making social choices", ["xml:lang"] = "en", }, }, table#2850 { ["itemType"] = table#2851 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2852 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1892934", }, ["subjectLabel"] = table#2853 { ["type"] = "literal", ["value"] = "Characterization of realizable space complexities", ["xml:lang"] = "en", }, }, table#2854 { ["itemType"] = table#2855 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2856 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1902617", }, ["subjectLabel"] = table#2857 { ["type"] = "literal", ["value"] = "Back and forth relations for reduced abelian \$p\$-groups", ["xml:lang"] = "en", }, }, table#2858 { ["itemType"] = table#2859 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2860 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1903129", }, ["subjectLabel"] = table#2861 { ["type"] = "literal", ["value"] = "Some results on numerical systems in \$\\lambda\$-calculus", ["xml:lang"] = "en", }, }, table#2862 { ["itemType"] = table#2863 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2864 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1905166", }, ["subjectLabel"] = table#2865 { ["type"] = "literal", ["value"] = "Operations and compositions in transrecursive operators", ["xml:lang"] = "en", }, }, table#2866 { ["itemType"] = table#2867 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2868 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1909606", }, ["subjectLabel"] = table#2869 { ["type"] = "literal", ["value"] = "Decidable and undecidable logics with a binary modality", ["xml:lang"] = "en", }, }, table#2870 { ["itemType"] = table#2871 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2872 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1910281", }, ["subjectLabel"] = table#2873 { ["type"] = "literal", ["value"] = "Relations between certain reducibilities", ["xml:lang"] = "en", }, }, table#2874 { ["itemType"] = table#2875 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2876 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1910286", }, ["subjectLabel"] = table#2877 { ["type"] = "literal", ["value"] = "Categoricity of finitely generated algebraic systems in HF-logic", ["xml:lang"] = "en", }, }, table#2878 { ["itemType"] = table#2879 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2880 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1910291", }, ["subjectLabel"] = table#2881 { ["type"] = "literal", ["value"] = "One strengthening of \$Q\$-reducibility", ["xml:lang"] = "en", }, }, table#2882 { ["itemType"] = table#2883 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2884 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1915126", }, ["subjectLabel"] = table#2885 { ["type"] = "literal", ["value"] = "Logic and probabilistic systems", ["xml:lang"] = "en", }, }, table#2886 { ["itemType"] = table#2887 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2888 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1919986", }, ["subjectLabel"] = table#2889 { ["type"] = "literal", ["value"] = "The intrinsic difficulty of recursive functions", ["xml:lang"] = "en", }, }, table#2890 { ["itemType"] = table#2891 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2892 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1920268", }, ["subjectLabel"] = table#2893 { ["type"] = "literal", ["value"] = "Fuzzy logic and arithmetical hierarchy", ["xml:lang"] = "en", }, }, table#2894 { ["itemType"] = table#2895 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2896 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1923565", }, ["subjectLabel"] = table#2897 { ["type"] = "literal", ["value"] = "Effective inseparability in a topological setting", ["xml:lang"] = "en", }, }, table#2898 { ["itemType"] = table#2899 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2900 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1924732", }, ["subjectLabel"] = table#2901 { ["type"] = "literal", ["value"] = "Recursion theoretic models of learning: Some results and intuitions", ["xml:lang"] = "en", }, }, table#2902 { ["itemType"] = table#2903 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2904 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1924734", }, ["subjectLabel"] = table#2905 { ["type"] = "literal", ["value"] = "The expressiveness of locally stratified programs", ["xml:lang"] = "en", }, }, table#2906 { ["itemType"] = table#2907 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2908 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1924787", }, ["subjectLabel"] = table#2909 { ["type"] = "literal", ["value"] = "On computability by logic programs", ["xml:lang"] = "en", }, }, table#2910 { ["itemType"] = table#2911 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2912 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1932174", }, ["subjectLabel"] = table#2913 { ["type"] = "literal", ["value"] = "Learning secrets interactively. Dynamic modeling in inductive inference", ["xml:lang"] = "en", }, }, table#2914 { ["itemType"] = table#2915 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2916 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1947035", }, ["subjectLabel"] = table#2917 { ["type"] = "literal", ["value"] = "Paradox and potential infinity", ["xml:lang"] = "en", }, }, table#2918 { ["itemType"] = table#2919 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2920 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1949167", }, ["subjectLabel"] = table#2921 { ["type"] = "literal", ["value"] = "Degrees of categoricity and the hyperarithmetic hierarchy", ["xml:lang"] = "en", }, }, table#2922 { ["itemType"] = table#2923 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2924 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1956598", }, ["subjectLabel"] = table#2925 { ["type"] = "literal", ["value"] = "Isolated 2-computably enumerable \$Q\$-degrees", ["xml:lang"] = "en", }, }, table#2926 { ["itemType"] = table#2927 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2928 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1959396", }, ["subjectLabel"] = table#2929 { ["type"] = "literal", ["value"] = "Limit complexities revisited", ["xml:lang"] = "en", }, }, table#2930 { ["itemType"] = table#2931 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2932 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1961375", }, ["subjectLabel"] = table#2933 { ["type"] = "literal", ["value"] = "Complexity limitations on quantum computation", ["xml:lang"] = "en", }, }, table#2934 { ["itemType"] = table#2935 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2936 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1961959", }, ["subjectLabel"] = table#2937 { ["type"] = "literal", ["value"] = "Computable preference and utility", ["xml:lang"] = "en", }, }, table#2938 { ["itemType"] = table#2939 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2940 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1965504", }, ["subjectLabel"] = table#2941 { ["type"] = "literal", ["value"] = "Time paradoxes reviewed", ["xml:lang"] = "en", }, }, table#2942 { ["itemType"] = table#2943 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2944 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1972201", }, ["subjectLabel"] = table#2945 { ["type"] = "literal", ["value"] = "Turing reducibility as algebraic embeddability", ["xml:lang"] = "en", }, }, table#2946 { ["itemType"] = table#2947 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2948 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1972524", }, ["subjectLabel"] = table#2949 { ["type"] = "literal", ["value"] = "Some reducibilities and splittings of recursively enumerable sets", ["xml:lang"] = "en", }, }, table#2950 { ["itemType"] = table#2951 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2952 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1977153", }, ["subjectLabel"] = table#2953 { ["type"] = "literal", ["value"] = "On the time complexity of partial real functions", ["xml:lang"] = "en", }, }, table#2954 { ["itemType"] = table#2955 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2956 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1978315", }, ["subjectLabel"] = table#2957 { ["type"] = "literal", ["value"] = "Heterogeneous active agents. III: Polynomially implementable agents", ["xml:lang"] = "en", }, }, table#2958 { ["itemType"] = table#2959 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2960 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1982020", }, ["subjectLabel"] = table#2961 { ["type"] = "literal", ["value"] = "The complexity of module radicals", ["xml:lang"] = "en", }, }, table#2962 { ["itemType"] = table#2963 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2964 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1989327", }, ["subjectLabel"] = table#2965 { ["type"] = "literal", ["value"] = "The fixed point problem of a simple reversible language", ["xml:lang"] = "en", }, }, table#2966 { ["itemType"] = table#2967 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2968 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1989331", }, ["subjectLabel"] = table#2969 { ["type"] = "literal", ["value"] = "A class of recursive permutations which is primitive recursive complete", ["xml:lang"] = "en", }, }, table#2970 { ["itemType"] = table#2971 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2972 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1998840", }, ["subjectLabel"] = table#2973 { ["type"] = "literal", ["value"] = "Direct product primality testing of graphs is GI-hard", ["xml:lang"] = "en", }, }, table#2974 { ["itemType"] = table#2975 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2976 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1998859", }, ["subjectLabel"] = table#2977 { ["type"] = "literal", ["value"] = "A new quantum random number generator certified by value indefiniteness", ["xml:lang"] = "en", }, }, table#2978 { ["itemType"] = table#2979 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2980 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2002476", }, ["subjectLabel"] = table#2981 { ["type"] = "literal", ["value"] = "Primitively recursively categorical linear orderings", ["xml:lang"] = "en", }, }, table#2982 { ["itemType"] = table#2983 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2984 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2011636", }, ["subjectLabel"] = table#2985 { ["type"] = "literal", ["value"] = "Outline of partial computability in computable topology", ["xml:lang"] = "en", }, }, table#2986 { ["itemType"] = table#2987 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2988 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2011663", }, ["subjectLabel"] = table#2989 { ["type"] = "literal", ["value"] = "On higher effective descriptive set theory", ["xml:lang"] = "en", }, }, table#2990 { ["itemType"] = table#2991 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2992 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2016057", }, ["subjectLabel"] = table#2993 { ["type"] = "literal", ["value"] = "Computability issues for adaptive logics in multi-consequence standard format", ["xml:lang"] = "en", }, }, table#2994 { ["itemType"] = table#2995 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#2996 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1803017", }, ["subjectLabel"] = table#2997 { ["type"] = "literal", ["value"] = "Upper semilattice of recursively enumerable sQ-degrees", ["xml:lang"] = "en", }, }, table#2998 { ["itemType"] = table#2999 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3000 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1803026", }, ["subjectLabel"] = table#3001 { ["type"] = "literal", ["value"] = "Refined hierarchy of formulas", ["xml:lang"] = "en", }, }, table#3002 { ["itemType"] = table#3003 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3004 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1805264", }, ["subjectLabel"] = table#3005 { ["type"] = "literal", ["value"] = "Is independence an exception?", ["xml:lang"] = "en", }, }, table#3006 { ["itemType"] = table#3007 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3008 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1807679", }, ["subjectLabel"] = table#3009 { ["type"] = "literal", ["value"] = "Reasoning about strings in databases", ["xml:lang"] = "en", }, }, table#3010 { ["itemType"] = table#3011 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3012 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1810819", }, ["subjectLabel"] = table#3013 { ["type"] = "literal", ["value"] = "A revenge-immune solution to the semantic paradoxes", ["xml:lang"] = "en", }, }, table#3014 { ["itemType"] = table#3015 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3016 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1810820", }, ["subjectLabel"] = table#3017 { ["type"] = "literal", ["value"] = "Possible-worlds semantics for modal notions conceived as predicates", ["xml:lang"] = "en", }, }, table#3018 { ["itemType"] = table#3019 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3020 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1812730", }, ["subjectLabel"] = table#3021 { ["type"] = "literal", ["value"] = "Computable classes of constructive models with non-limit-equivalent indexations", ["xml:lang"] = "en", }, }, table#3022 { ["itemType"] = table#3023 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3024 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1814099", }, ["subjectLabel"] = table#3025 { ["type"] = "literal", ["value"] = "Complexity of the calculus of continued fraction representation of real numbers", ["xml:lang"] = "en", }, }, table#3026 { ["itemType"] = table#3027 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3028 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1814465", }, ["subjectLabel"] = table#3029 { ["type"] = "literal", ["value"] = "A universal partial recursive function", ["xml:lang"] = "en", }, }, table#3030 { ["itemType"] = table#3031 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3032 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1817022", }, ["subjectLabel"] = table#3033 { ["type"] = "literal", ["value"] = "The calculi of emergence: Computation, dynamics and induction", ["xml:lang"] = "en", }, }, table#3034 { ["itemType"] = table#3035 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3036 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1820773", }, ["subjectLabel"] = table#3037 { ["type"] = "literal", ["value"] = "Effective choice functions and index sets", ["xml:lang"] = "en", }, }, table#3038 { ["itemType"] = table#3039 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3040 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1820774", }, ["subjectLabel"] = table#3041 { ["type"] = "literal", ["value"] = "Effectively hyperimmune sets and majorants", ["xml:lang"] = "en", }, }, table#3042 { ["itemType"] = table#3043 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3044 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1820775", }, ["subjectLabel"] = table#3045 { ["type"] = "literal", ["value"] = "Structure of the semilattice of tt1-degrees", ["xml:lang"] = "en", }, }, table#3046 { ["itemType"] = table#3047 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3048 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1820776", }, ["subjectLabel"] = table#3049 { ["type"] = "literal", ["value"] = "Generic objects in recursion theory. II: Operations on recursive approximation spaces", ["xml:lang"] = "en", }, }, table#3050 { ["itemType"] = table#3051 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3052 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1820779", }, ["subjectLabel"] = table#3053 { ["type"] = "literal", ["value"] = "Which set existence axioms are needed to prove the separable Hahn-Banach theorem?", ["xml:lang"] = "en", }, }, table#3054 { ["itemType"] = table#3055 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3056 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1821772", }, ["subjectLabel"] = table#3057 { ["type"] = "literal", ["value"] = "Categoricity in hyperarithmetical degrees", ["xml:lang"] = "en", }, }, table#3058 { ["itemType"] = table#3059 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3060 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1822631", }, ["subjectLabel"] = table#3061 { ["type"] = "literal", ["value"] = "Arithmetic hierarchy of Abelian groups", ["xml:lang"] = "en", }, }, table#3062 { ["itemType"] = table#3063 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3064 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1822937", }, ["subjectLabel"] = table#3065 { ["type"] = "literal", ["value"] = "Probabilistic termination versus fair termination", ["xml:lang"] = "en", }, }, table#3066 { ["itemType"] = table#3067 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3068 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1823882", }, ["subjectLabel"] = table#3069 { ["type"] = "literal", ["value"] = "An alternate approach to axiomatizations of the von Neumann/Morgenstern characteristic function", ["xml:lang"] = "en", }, }, table#3070 { ["itemType"] = table#3071 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3072 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1823932", }, ["subjectLabel"] = table#3073 { ["type"] = "literal", ["value"] = "Classes of recursively enumerable sets and Q-reducibility", ["xml:lang"] = "en", }, }, table#3074 { ["itemType"] = table#3075 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3076 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1825864", }, ["subjectLabel"] = table#3077 { ["type"] = "literal", ["value"] = "A decidable countably categorical model without nontrivial recursive automorphisms", ["xml:lang"] = "en", }, }, table#3078 { ["itemType"] = table#3079 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3080 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1825865", }, ["subjectLabel"] = table#3081 { ["type"] = "literal", ["value"] = "On the complexity of finding the chromatic number of a recursive graph. I: The bounded case", ["xml:lang"] = "en", }, }, table#3082 { ["itemType"] = table#3083 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3084 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1827400", }, ["subjectLabel"] = table#3085 { ["type"] = "literal", ["value"] = "On the computational complexity of Longley's \$H\$ functional", ["xml:lang"] = "en", }, }, table#3086 { ["itemType"] = table#3087 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3088 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1836662", }, ["subjectLabel"] = table#3089 { ["type"] = "literal", ["value"] = "The upper semilattice of numerations", ["xml:lang"] = "en", }, }, table#3090 { ["itemType"] = table#3091 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3092 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1837536", }, ["subjectLabel"] = table#3093 { ["type"] = "literal", ["value"] = "A metatheorem for undecidable properties of formal languages and its application to LRR and LLR grammars and languages", ["xml:lang"] = "en", }, }, table#3094 { ["itemType"] = table#3095 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3096 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1838840", }, ["subjectLabel"] = table#3097 { ["type"] = "literal", ["value"] = "Structure and complexity of relational queries", ["xml:lang"] = "en", }, }, table#3098 { ["itemType"] = table#3099 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3100 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1840464", }, ["subjectLabel"] = table#3101 { ["type"] = "literal", ["value"] = "Some orbits for \${\\mathcal E}\$", ["xml:lang"] = "en", }, }, table#3102 { ["itemType"] = table#3103 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3104 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1843564", }, ["subjectLabel"] = table#3105 { ["type"] = "literal", ["value"] = "Constructivizability of superatomic Boolean algebras", ["xml:lang"] = "en", }, }, table#3106 { ["itemType"] = table#3107 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3108 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1844659", }, ["subjectLabel"] = table#3109 { ["type"] = "literal", ["value"] = "A generalized constructable continuum", ["xml:lang"] = "en", }, }, table#3110 { ["itemType"] = table#3111 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3112 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1844662", }, ["subjectLabel"] = table#3113 { ["type"] = "literal", ["value"] = "Many-one degrees associated with semi-Thue systems", ["xml:lang"] = "en", }, }, table#3114 { ["itemType"] = table#3115 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3116 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1845719", }, ["subjectLabel"] = table#3117 { ["type"] = "literal", ["value"] = "Recursively enumerable many-one degrees", ["xml:lang"] = "en", }, }, table#3118 { ["itemType"] = table#3119 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3120 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1845881", }, ["subjectLabel"] = table#3121 { ["type"] = "literal", ["value"] = "Su certe teorie non enumerabili. (Sulle limitazioni dei sistemi formali. I.)", ["xml:lang"] = "en", }, }, table#3122 { ["itemType"] = table#3123 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3124 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1846417", }, ["subjectLabel"] = table#3125 { ["type"] = "literal", ["value"] = "Some aspects of generalized computability", ["xml:lang"] = "en", }, }, table#3126 { ["itemType"] = table#3127 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3128 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1846862", }, ["subjectLabel"] = table#3129 { ["type"] = "literal", ["value"] = "Some problems of completeness of arithmetic", ["xml:lang"] = "en", }, }, table#3130 { ["itemType"] = table#3131 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3132 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1849863", }, ["subjectLabel"] = table#3133 { ["type"] = "literal", ["value"] = "Orbits of computably enumerable sets: Low sets can avoid an upper cone", ["xml:lang"] = "en", }, }, table#3134 { ["itemType"] = table#3135 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3136 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1849864", }, ["subjectLabel"] = table#3137 { ["type"] = "literal", ["value"] = "Some conservation results on weak König's lemma", ["xml:lang"] = "en", }, }, table#3138 { ["itemType"] = table#3139 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3140 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1853518", }, ["subjectLabel"] = table#3141 { ["type"] = "literal", ["value"] = "Learning classes of approximations to non-recursive functions.", ["xml:lang"] = "en", }, }, table#3142 { ["itemType"] = table#3143 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3144 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1854290", }, ["subjectLabel"] = table#3145 { ["type"] = "literal", ["value"] = "The synthesis of language learners.", ["xml:lang"] = "en", }, }, table#3146 { ["itemType"] = table#3147 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3148 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1854293", }, ["subjectLabel"] = table#3149 { ["type"] = "literal", ["value"] = "Incremental concept learning for bounded data mining.", ["xml:lang"] = "en", }, }, table#3150 { ["itemType"] = table#3151 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3152 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1854307", }, ["subjectLabel"] = table#3153 { ["type"] = "literal", ["value"] = "Recursive computational depth.", ["xml:lang"] = "en", }, }, table#3154 { ["itemType"] = table#3155 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3156 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1854310", }, ["subjectLabel"] = table#3157 { ["type"] = "literal", ["value"] = "Robust behaviorally correct learning.", ["xml:lang"] = "en", }, }, table#3158 { ["itemType"] = table#3159 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3160 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1854315", }, ["subjectLabel"] = table#3161 { ["type"] = "literal", ["value"] = "The complexity of universal text-learners.", ["xml:lang"] = "en", }, }, table#3162 { ["itemType"] = table#3163 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3164 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1854426", }, ["subjectLabel"] = table#3165 { ["type"] = "literal", ["value"] = "On a generalized notion of mistake bounds", ["xml:lang"] = "en", }, }, table#3166 { ["itemType"] = table#3167 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3168 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1854535", }, ["subjectLabel"] = table#3169 { ["type"] = "literal", ["value"] = "Suboptimal measures of predictive complexity for absolute loss function", ["xml:lang"] = "en", }, }, table#3170 { ["itemType"] = table#3171 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3172 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1854541", }, ["subjectLabel"] = table#3173 { ["type"] = "literal", ["value"] = "Learning by the process of elimination", ["xml:lang"] = "en", }, }, table#3174 { ["itemType"] = table#3175 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3176 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1854543", }, ["subjectLabel"] = table#3177 { ["type"] = "literal", ["value"] = "Degrees of Dowd-type generic oracles", ["xml:lang"] = "en", }, }, table#3178 { ["itemType"] = table#3179 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3180 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1854565", }, ["subjectLabel"] = table#3181 { ["type"] = "literal", ["value"] = "On complexity of easy predictable sequences", ["xml:lang"] = "en", }, }, table#3182 { ["itemType"] = table#3183 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3184 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1855213", }, ["subjectLabel"] = table#3185 { ["type"] = "literal", ["value"] = "Tractable reasoning via approximation", ["xml:lang"] = "en", }, }, table#3186 { ["itemType"] = table#3187 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3188 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1855217", }, ["subjectLabel"] = table#3189 { ["type"] = "literal", ["value"] = "Levesque's axiomatization of only knowing is incomplete", ["xml:lang"] = "en", }, }, table#3190 { ["itemType"] = table#3191 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3192 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1861135", }, ["subjectLabel"] = table#3193 { ["type"] = "literal", ["value"] = "Complexity of the \$r\$-query tautologies in the presence of a generic oracle", ["xml:lang"] = "en", }, }, table#3194 { ["itemType"] = table#3195 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3196 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1861328", }, ["subjectLabel"] = table#3197 { ["type"] = "literal", ["value"] = "The complexity of predicate default logic over a countable domain", ["xml:lang"] = "en", }, }, table#3198 { ["itemType"] = table#3199 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3200 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q1861534", }, ["subjectLabel"] = table#3201 { ["type"] = "literal", ["value"] = "Thue trees", ["xml:lang"] = "en", }, }, table#3202 { ["itemType"] = table#3203 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3204 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2360292", }, ["subjectLabel"] = table#3205 { ["type"] = "literal", ["value"] = "On some reducibility and existential interpretability of structures", ["xml:lang"] = "en", }, }, table#3206 { ["itemType"] = table#3207 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3208 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2361673", }, ["subjectLabel"] = table#3209 { ["type"] = "literal", ["value"] = "Elementary theories and structural properties of d-c.e. and n-c.e. degrees", ["xml:lang"] = "en", }, }, table#3210 { ["itemType"] = table#3211 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3212 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2363961", }, ["subjectLabel"] = table#3213 { ["type"] = "literal", ["value"] = "On Boolean closed full trios and rational Kripke frames", ["xml:lang"] = "en", }, }, table#3214 { ["itemType"] = table#3215 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3216 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2363964", }, ["subjectLabel"] = table#3217 { ["type"] = "literal", ["value"] = "A solution to Wiehagen's thesis", ["xml:lang"] = "en", }, }, table#3218 { ["itemType"] = table#3219 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3220 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2364293", }, ["subjectLabel"] = table#3221 { ["type"] = "literal", ["value"] = "Degrees of autostability relative to strong constructivizations for Boolean algebras", ["xml:lang"] = "en", }, }, table#3222 { ["itemType"] = table#3223 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3224 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2364326", }, ["subjectLabel"] = table#3225 { ["type"] = "literal", ["value"] = "Embeddability of the semilattice \$L_m^0\$ in Rogers semilattices", ["xml:lang"] = "en", }, }, table#3226 { ["itemType"] = table#3227 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3228 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2364330", }, ["subjectLabel"] = table#3229 { ["type"] = "literal", ["value"] = "Degrees of autostability for linear orders and linearly ordered abelian groups", ["xml:lang"] = "en", }, }, table#3230 { ["itemType"] = table#3231 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3232 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2364345", }, ["subjectLabel"] = table#3233 { ["type"] = "literal", ["value"] = "A generic relation on recursively enumerable sets", ["xml:lang"] = "en", }, }, table#3234 { ["itemType"] = table#3235 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3236 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2365394", }, ["subjectLabel"] = table#3237 { ["type"] = "literal", ["value"] = "Computable processes and bisimulation equivalence", ["xml:lang"] = "en", }, }, table#3238 { ["itemType"] = table#3239 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3240 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2366196", }, ["subjectLabel"] = table#3241 { ["type"] = "literal", ["value"] = "Non-computable rational expectations equilibria", ["xml:lang"] = "en", }, }, table#3242 { ["itemType"] = table#3243 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3244 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2366356", }, ["subjectLabel"] = table#3245 { ["type"] = "literal", ["value"] = "Effective choice of constructivizations and recursive consistency of problems on constructive models", ["xml:lang"] = "en", }, }, table#3246 { ["itemType"] = table#3247 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3248 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2366357", }, ["subjectLabel"] = table#3249 { ["type"] = "literal", ["value"] = "Positive algebras with countable congruence lattices", ["xml:lang"] = "en", }, }, table#3250 { ["itemType"] = table#3251 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3252 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2366359", }, ["subjectLabel"] = table#3253 { ["type"] = "literal", ["value"] = "Semantic universality of theories over a superlist", ["xml:lang"] = "en", }, }, table#3254 { ["itemType"] = table#3255 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3256 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2368918", }, ["subjectLabel"] = table#3257 { ["type"] = "literal", ["value"] = "Generality's price: Inescapable deficiencies in machine-learned programs", ["xml:lang"] = "en", }, }, table#3258 { ["itemType"] = table#3259 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3260 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2377350", }, ["subjectLabel"] = table#3261 { ["type"] = "literal", ["value"] = "An example related to Gregory's theorem", ["xml:lang"] = "en", }, }, table#3262 { ["itemType"] = table#3263 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3264 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2145868", }, ["subjectLabel"] = table#3265 { ["type"] = "literal", ["value"] = "Virtual algebraic isomorphisms between predicate calculi of finite rich signatures", ["xml:lang"] = "en", }, }, table#3266 { ["itemType"] = table#3267 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3268 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2382237", }, ["subjectLabel"] = table#3269 { ["type"] = "literal", ["value"] = "There exists a maximal 3-c.e. enumeration degree", ["xml:lang"] = "en", }, }, table#3270 { ["itemType"] = table#3271 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3272 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2148810", }, ["subjectLabel"] = table#3273 { ["type"] = "literal", ["value"] = "Approximating approximate reasoning: fuzzy sets and the Ershov hierarchy", ["xml:lang"] = "en", }, }, table#3274 { ["itemType"] = table#3275 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3276 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2148902", }, ["subjectLabel"] = table#3277 { ["type"] = "literal", ["value"] = "Partial combinatory algebra and generalized numberings", ["xml:lang"] = "en", }, }, table#3278 { ["itemType"] = table#3279 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3280 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2153830", }, ["subjectLabel"] = table#3281 { ["type"] = "literal", ["value"] = "Decision times of infinite computations", ["xml:lang"] = "en", }, }, table#3282 { ["itemType"] = table#3283 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3284 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2165606", }, ["subjectLabel"] = table#3285 { ["type"] = "literal", ["value"] = "Inner constructivizability of functional structures", ["xml:lang"] = "en", }, }, table#3286 { ["itemType"] = table#3287 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3288 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2187270", }, ["subjectLabel"] = table#3289 { ["type"] = "literal", ["value"] = "The theory of ceers computes true arithmetic", ["xml:lang"] = "en", }, }, table#3290 { ["itemType"] = table#3291 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3292 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2190904", }, ["subjectLabel"] = table#3293 { ["type"] = "literal", ["value"] = "On alphabetic coding for superwords", ["xml:lang"] = "en", }, }, table#3294 { ["itemType"] = table#3295 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3296 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2191390", }, ["subjectLabel"] = table#3297 { ["type"] = "literal", ["value"] = "Universal functions and \$K \\Sigma \$-structures", ["xml:lang"] = "en", }, }, table#3298 { ["itemType"] = table#3299 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3300 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2193224", }, ["subjectLabel"] = table#3301 { ["type"] = "literal", ["value"] = "Enumerating abelian \$p\$-groups", ["xml:lang"] = "en", }, }, table#3302 { ["itemType"] = table#3303 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3304 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2193280", }, ["subjectLabel"] = table#3305 { ["type"] = "literal", ["value"] = "On the complexity of linear temporal logic with team semantics", ["xml:lang"] = "en", }, }, table#3306 { ["itemType"] = table#3307 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3308 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2204365", }, ["subjectLabel"] = table#3309 { ["type"] = "literal", ["value"] = "Incomparability in local structures of \$s\$-degrees and \$Q\$-degrees", ["xml:lang"] = "en", }, }, table#3310 { ["itemType"] = table#3311 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3312 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2205949", }, ["subjectLabel"] = table#3313 { ["type"] = "literal", ["value"] = "Online presentations of finitely generated structures", ["xml:lang"] = "en", }, }, table#3314 { ["itemType"] = table#3315 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3316 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2205967", }, ["subjectLabel"] = table#3317 { ["type"] = "literal", ["value"] = "From NP-completeness to DP-completeness: a membrane computing perspective", ["xml:lang"] = "en", }, }, table#3318 { ["itemType"] = table#3319 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3320 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2207016", }, ["subjectLabel"] = table#3321 { ["type"] = "literal", ["value"] = "On undecidability of concatenation theory for one-symbol languages", ["xml:lang"] = "en", }, }, table#3322 { ["itemType"] = table#3323 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3324 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2207026", }, ["subjectLabel"] = table#3325 { ["type"] = "literal", ["value"] = "On degree spectra of topological spaces", ["xml:lang"] = "en", }, }, table#3326 { ["itemType"] = table#3327 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3328 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2212696", }, ["subjectLabel"] = table#3329 { ["type"] = "literal", ["value"] = "The property of being a model complete theory is preserved by Cartesian extensions", ["xml:lang"] = "en", }, }, table#3330 { ["itemType"] = table#3331 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3332 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2213916", }, ["subjectLabel"] = table#3333 { ["type"] = "literal", ["value"] = "Turing degrees and automorphism groups of substructure lattices", ["xml:lang"] = "en", }, }, table#3334 { ["itemType"] = table#3335 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3336 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2213918", }, ["subjectLabel"] = table#3337 { ["type"] = "literal", ["value"] = "Computable positive and Friedberg numberings in hyperarithmetic", ["xml:lang"] = "en", }, }, table#3338 { ["itemType"] = table#3339 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3340 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2219096", }, ["subjectLabel"] = table#3341 { ["type"] = "literal", ["value"] = "A note on uniform density in weak arithmetical theories", ["xml:lang"] = "en", }, }, table#3342 { ["itemType"] = table#3343 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3344 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2220485", }, ["subjectLabel"] = table#3345 { ["type"] = "literal", ["value"] = "Intuitionistic fixed point logic", ["xml:lang"] = "en", }, }, table#3346 { ["itemType"] = table#3347 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3348 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2232273", }, ["subjectLabel"] = table#3349 { ["type"] = "literal", ["value"] = "Learnability and positive equivalence relations", ["xml:lang"] = "en", }, }, table#3350 { ["itemType"] = table#3351 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3352 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2235748", }, ["subjectLabel"] = table#3353 { ["type"] = "literal", ["value"] = "Quasi-universal \$k\$-regular sequences", ["xml:lang"] = "en", }, }, table#3354 { ["itemType"] = table#3355 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3356 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2238145", }, ["subjectLabel"] = table#3357 { ["type"] = "literal", ["value"] = "The automorphism group and definability of the jump operator in the \$\\omega\$-enumeration degrees", ["xml:lang"] = "en", }, }, table#3358 { ["itemType"] = table#3359 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3360 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2243580", }, ["subjectLabel"] = table#3361 { ["type"] = "literal", ["value"] = "Bi-immunity over different size alphabets", ["xml:lang"] = "en", }, }, table#3362 { ["itemType"] = table#3363 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3364 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2246823", }, ["subjectLabel"] = table#3365 { ["type"] = "literal", ["value"] = "Universal functions and \$\\Sigma_\\omega \$-bounded structures", ["xml:lang"] = "en", }, }, table#3366 { ["itemType"] = table#3367 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3368 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2250553", }, ["subjectLabel"] = table#3369 { ["type"] = "literal", ["value"] = "Stochastic \$\\lambda\$-calculi: an extended abstract", ["xml:lang"] = "en", }, }, table#3370 { ["itemType"] = table#3371 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3372 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2252522", }, ["subjectLabel"] = table#3373 { ["type"] = "literal", ["value"] = "Computational completeness of equations over sets of natural numbers", ["xml:lang"] = "en", }, }, table#3374 { ["itemType"] = table#3375 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3376 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2253188", }, ["subjectLabel"] = table#3377 { ["type"] = "literal", ["value"] = "Realizability with a local operator of A. M. Pitts", ["xml:lang"] = "en", }, }, table#3378 { ["itemType"] = table#3379 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3380 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2253863", }, ["subjectLabel"] = table#3381 { ["type"] = "literal", ["value"] = "Extended fuzzy constructive logic", ["xml:lang"] = "en", }, }, table#3382 { ["itemType"] = table#3383 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3384 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2254632", }, ["subjectLabel"] = table#3385 { ["type"] = "literal", ["value"] = "A dissimilarity-based framework for generating inconsistency-tolerant logics", ["xml:lang"] = "en", }, }, table#3386 { ["itemType"] = table#3387 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3388 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2258841", }, ["subjectLabel"] = table#3389 { ["type"] = "literal", ["value"] = "Models of computation for partial functions on the reals", ["xml:lang"] = "en", }, }, table#3390 { ["itemType"] = table#3391 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3392 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2263107", }, ["subjectLabel"] = table#3393 { ["type"] = "literal", ["value"] = "Limitwise monotonic functions relative to the Kleene's ordinal notation system", ["xml:lang"] = "en", }, }, table#3394 { ["itemType"] = table#3395 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3396 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2263109", }, ["subjectLabel"] = table#3397 { ["type"] = "literal", ["value"] = "Using computability to measure complexity of algebraic structures and classes of structures", ["xml:lang"] = "en", }, }, table#3398 { ["itemType"] = table#3399 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3400 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2263113", }, ["subjectLabel"] = table#3401 { ["type"] = "literal", ["value"] = "Maximality and minimality under limitwise monotonic reducibility", ["xml:lang"] = "en", }, }, table#3402 { ["itemType"] = table#3403 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3404 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2265426", }, ["subjectLabel"] = table#3405 { ["type"] = "literal", ["value"] = "On degrees of recursively enumerable sets", ["xml:lang"] = "en", }, }, table#3406 { ["itemType"] = table#3407 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3408 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2266723", }, ["subjectLabel"] = table#3409 { ["type"] = "literal", ["value"] = "A theory of recursive dimension of ordered sets", ["xml:lang"] = "en", }, }, table#3410 { ["itemType"] = table#3411 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3412 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2270233", }, ["subjectLabel"] = table#3413 { ["type"] = "literal", ["value"] = "Triangular norm based predicate fuzzy logics", ["xml:lang"] = "en", }, }, table#3414 { ["itemType"] = table#3415 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3416 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2018655", }, ["subjectLabel"] = table#3417 { ["type"] = "literal", ["value"] = "Action of an FE-closure operator on functions of countable-valued logic", ["xml:lang"] = "en", }, }, table#3418 { ["itemType"] = table#3419 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3420 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2271426", }, ["subjectLabel"] = table#3421 { ["type"] = "literal", ["value"] = "The ``equal last letter'' predicate for words on infinite alphabets and classes of multitape automata", ["xml:lang"] = "en", }, }, table#3422 { ["itemType"] = table#3423 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3424 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2276952", }, ["subjectLabel"] = table#3425 { ["type"] = "literal", ["value"] = "Sub-arithmetical ultrapowers: A survey", ["xml:lang"] = "en", }, }, table#3426 { ["itemType"] = table#3427 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3428 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2277249", }, ["subjectLabel"] = table#3429 { ["type"] = "literal", ["value"] = "Verification of concurrent programs: The automata-theoretic framework", ["xml:lang"] = "en", }, }, table#3430 { ["itemType"] = table#3431 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3432 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2277252", }, ["subjectLabel"] = table#3433 { ["type"] = "literal", ["value"] = "On computational complexity and honest polynomial degrees", ["xml:lang"] = "en", }, }, table#3434 { ["itemType"] = table#3435 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3436 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2277260", }, ["subjectLabel"] = table#3437 { ["type"] = "literal", ["value"] = "Type 2 computational complexity of functions on Cantor's space", ["xml:lang"] = "en", }, }, table#3438 { ["itemType"] = table#3439 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3440 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2026737", }, ["subjectLabel"] = table#3441 { ["type"] = "literal", ["value"] = "Characterizations of ITBM-computability. I", ["xml:lang"] = "en", }, }, table#3442 { ["itemType"] = table#3443 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3444 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2033006", }, ["subjectLabel"] = table#3445 { ["type"] = "literal", ["value"] = "Punctual definability on structures", ["xml:lang"] = "en", }, }, table#3446 { ["itemType"] = table#3447 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3448 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2033336", }, ["subjectLabel"] = table#3449 { ["type"] = "literal", ["value"] = "Computable metrics above the standard real metric", ["xml:lang"] = "en", }, }, table#3450 { ["itemType"] = table#3451 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3452 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2286740", }, ["subjectLabel"] = table#3453 { ["type"] = "literal", ["value"] = "Searching for shortest and least programs", ["xml:lang"] = "en", }, }, table#3454 { ["itemType"] = table#3455 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3456 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2036465", }, ["subjectLabel"] = table#3457 { ["type"] = "literal", ["value"] = "Turing computability: structural theory", ["xml:lang"] = "en", }, }, table#3458 { ["itemType"] = table#3459 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3460 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2036466", }, ["subjectLabel"] = table#3461 { ["type"] = "literal", ["value"] = "Categoricity spectra of computable structures", ["xml:lang"] = "en", }, }, table#3462 { ["itemType"] = table#3463 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3464 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2036468", }, ["subjectLabel"] = table#3465 { ["type"] = "literal", ["value"] = "Computable linear orders and limitwise monotonic functions", ["xml:lang"] = "en", }, }, table#3466 { ["itemType"] = table#3467 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3468 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2036469", }, ["subjectLabel"] = table#3469 { ["type"] = "literal", ["value"] = "Precomplete numberings", ["xml:lang"] = "en", }, }, table#3470 { ["itemType"] = table#3471 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3472 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2036471", }, ["subjectLabel"] = table#3473 { ["type"] = "literal", ["value"] = "Degree spectra of structures", ["xml:lang"] = "en", }, }, table#3474 { ["itemType"] = table#3475 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3476 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2037201", }, ["subjectLabel"] = table#3477 { ["type"] = "literal", ["value"] = "Closure and nonclosure properties of the classes of compressible and rankable sets", ["xml:lang"] = "en", }, }, table#3478 { ["itemType"] = table#3479 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3480 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2043819", }, ["subjectLabel"] = table#3481 { ["type"] = "literal", ["value"] = "The origins of the halting problem", ["xml:lang"] = "en", }, }, table#3482 { ["itemType"] = table#3483 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3484 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2043872", }, ["subjectLabel"] = table#3485 { ["type"] = "literal", ["value"] = "On decidability of theories of regular languages", ["xml:lang"] = "en", }, }, table#3486 { ["itemType"] = table#3487 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3488 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2300735", }, ["subjectLabel"] = table#3489 { ["type"] = "literal", ["value"] = "Weakly precomplete equivalence relations in the Ershov hierarchy", ["xml:lang"] = "en", }, }, table#3490 { ["itemType"] = table#3491 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3492 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2300737", }, ["subjectLabel"] = table#3493 { ["type"] = "literal", ["value"] = "Computable numberings of families of infinite sets", ["xml:lang"] = "en", }, }, table#3494 { ["itemType"] = table#3495 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3496 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2300743", }, ["subjectLabel"] = table#3497 { ["type"] = "literal", ["value"] = "Turing degrees of complete formulas of almost prime models", ["xml:lang"] = "en", }, }, table#3498 { ["itemType"] = table#3499 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3500 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2300935", }, ["subjectLabel"] = table#3501 { ["type"] = "literal", ["value"] = "\$\\Sigma\$-preorderings in \$\\mathbb{HF}(\\mathbb{R} )\$", ["xml:lang"] = "en", }, }, table#3502 { ["itemType"] = table#3503 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3504 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2051759", }, ["subjectLabel"] = table#3505 { ["type"] = "literal", ["value"] = "On the amount of nonconstructivity in learning formal languages from text", ["xml:lang"] = "en", }, }, table#3506 { ["itemType"] = table#3507 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3508 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2054224", }, ["subjectLabel"] = table#3509 { ["type"] = "literal", ["value"] = "Primitively recursive categoricity for unars and equivalence structures", ["xml:lang"] = "en", }, }, table#3510 { ["itemType"] = table#3511 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3512 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2055962", }, ["subjectLabel"] = table#3513 { ["type"] = "literal", ["value"] = "A thesis for interaction", ["xml:lang"] = "en", }, }, table#3514 { ["itemType"] = table#3515 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3516 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2309496", }, ["subjectLabel"] = table#3517 { ["type"] = "literal", ["value"] = "Weaker variants of infinite time Turing machines", ["xml:lang"] = "en", }, }, table#3518 { ["itemType"] = table#3519 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3520 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2309506", }, ["subjectLabel"] = table#3521 { ["type"] = "literal", ["value"] = "Scott sentences for equivalence structures", ["xml:lang"] = "en", }, }, table#3522 { ["itemType"] = table#3523 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3524 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2311222", }, ["subjectLabel"] = table#3525 { ["type"] = "literal", ["value"] = "Probability 1 computation with chemical reaction networks", ["xml:lang"] = "en", }, }, table#3526 { ["itemType"] = table#3527 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3528 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2312080", }, ["subjectLabel"] = table#3529 { ["type"] = "literal", ["value"] = "Comparing the degrees of enumerability and the closed Medvedev degrees", ["xml:lang"] = "en", }, }, table#3530 { ["itemType"] = table#3531 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3532 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2313294", }, ["subjectLabel"] = table#3533 { ["type"] = "literal", ["value"] = "Rogers semilattices for families of equivalence relations in the Ershov hierarchy", ["xml:lang"] = "en", }, }, table#3534 { ["itemType"] = table#3535 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3536 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2066097", }, ["subjectLabel"] = table#3537 { ["type"] = "literal", ["value"] = "The category of equivalence relations", ["xml:lang"] = "en", }, }, table#3538 { ["itemType"] = table#3539 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3540 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2067638", }, ["subjectLabel"] = table#3541 { ["type"] = "literal", ["value"] = "Infinitary action logic with exponentiation", ["xml:lang"] = "en", }, }, table#3542 { ["itemType"] = table#3543 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3544 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2319854", }, ["subjectLabel"] = table#3545 { ["type"] = "literal", ["value"] = "A game-semantic model of computation", ["xml:lang"] = "en", }, }, table#3546 { ["itemType"] = table#3547 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3548 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2332060", }, ["subjectLabel"] = table#3549 { ["type"] = "literal", ["value"] = "On decidability of list structures", ["xml:lang"] = "en", }, }, table#3550 { ["itemType"] = table#3551 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3552 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2332068", }, ["subjectLabel"] = table#3553 { ["type"] = "literal", ["value"] = "Partial decidable presentations in hyperarithmetic", ["xml:lang"] = "en", }, }, table#3554 { ["itemType"] = table#3555 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3556 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2097420", }, ["subjectLabel"] = table#3557 { ["type"] = "literal", ["value"] = "Certifying algorithms and relevant properties of reversible primitive permutations with \\textsf{Lean}", ["xml:lang"] = "en", }, }, table#3558 { ["itemType"] = table#3559 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3560 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2342098", }, ["subjectLabel"] = table#3561 { ["type"] = "literal", ["value"] = "Abelian \$p\$-groups and autostability relative to an oracle", ["xml:lang"] = "en", }, }, table#3562 { ["itemType"] = table#3563 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3564 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2342320", }, ["subjectLabel"] = table#3565 { ["type"] = "literal", ["value"] = "Families without minimal numberings", ["xml:lang"] = "en", }, }, table#3566 { ["itemType"] = table#3567 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3568 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2345861", }, ["subjectLabel"] = table#3569 { ["type"] = "literal", ["value"] = "The exact complexity of the infinite Post Correspondence Problem", ["xml:lang"] = "en", }, }, table#3570 { ["itemType"] = table#3571 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3572 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2105439", }, ["subjectLabel"] = table#3573 { ["type"] = "literal", ["value"] = "Intensional Kleene and Rice theorems for abstract program semantics", ["xml:lang"] = "en", }, }, table#3574 { ["itemType"] = table#3575 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3576 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2106597", }, ["subjectLabel"] = table#3577 { ["type"] = "literal", ["value"] = "On the interplay between inductive inference of recursive functions, complexity theory and recursive numberings", ["xml:lang"] = "en", }, }, table#3578 { ["itemType"] = table#3579 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3580 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2349101", }, ["subjectLabel"] = table#3581 { ["type"] = "literal", ["value"] = "A reducibility related to being hyperimmune-free", ["xml:lang"] = "en", }, }, table#3582 { ["itemType"] = table#3583 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3584 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2354582", }, ["subjectLabel"] = table#3585 { ["type"] = "literal", ["value"] = "Symbolic dynamics: entropy = dimension = complexity", ["xml:lang"] = "en", }, }, table#3586 { ["itemType"] = table#3587 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3588 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2117790", }, ["subjectLabel"] = table#3589 { ["type"] = "literal", ["value"] = "Towards a map for incremental learning in the limit from positive and negative information", ["xml:lang"] = "en", }, }, table#3590 { ["itemType"] = table#3591 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3592 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2117798", }, ["subjectLabel"] = table#3593 { ["type"] = "literal", ["value"] = "Subrecursive equivalence relations and (non-)closure under lattice operations", ["xml:lang"] = "en", }, }, table#3594 { ["itemType"] = table#3595 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3596 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2117803", }, ["subjectLabel"] = table#3597 { ["type"] = "literal", ["value"] = "Non-collapse of the effective wadge hierarchy", ["xml:lang"] = "en", }, }, table#3598 { ["itemType"] = table#3599 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3600 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2118167", }, ["subjectLabel"] = table#3601 { ["type"] = "literal", ["value"] = "Degree structures of conjunctive reducibility", ["xml:lang"] = "en", }, }, table#3602 { ["itemType"] = table#3603 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3604 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2629934", }, ["subjectLabel"] = table#3605 { ["type"] = "literal", ["value"] = "Membrane system models for super-Turing paradigms", ["xml:lang"] = "en", }, }, table#3606 { ["itemType"] = table#3607 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3608 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2630830", }, ["subjectLabel"] = table#3609 { ["type"] = "literal", ["value"] = "The automorphism group of the enumeration degrees", ["xml:lang"] = "en", }, }, table#3610 { ["itemType"] = table#3611 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3612 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2383593", }, ["subjectLabel"] = table#3613 { ["type"] = "literal", ["value"] = "The Kolmogorov complexity of infinite words", ["xml:lang"] = "en", }, }, table#3614 { ["itemType"] = table#3615 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3616 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2383595", }, ["subjectLabel"] = table#3617 { ["type"] = "literal", ["value"] = "Algorithmic complexity as a criterion of unsolvability", ["xml:lang"] = "en", }, }, table#3618 { ["itemType"] = table#3619 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3620 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2639056", }, ["subjectLabel"] = table#3621 { ["type"] = "literal", ["value"] = "Iterated Kleene computability", ["xml:lang"] = "en", }, }, table#3622 { ["itemType"] = table#3623 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3624 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2639644", }, ["subjectLabel"] = table#3625 { ["type"] = "literal", ["value"] = "The fixed points of logic programs with Herbrand base \${\\mathbb{N}}\$", ["xml:lang"] = "en", }, }, table#3626 { ["itemType"] = table#3627 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3628 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2384927", }, ["subjectLabel"] = table#3629 { ["type"] = "literal", ["value"] = "Results on memory-limited U-shaped learning", ["xml:lang"] = "en", }, }, table#3630 { ["itemType"] = table#3631 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3632 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2388434", }, ["subjectLabel"] = table#3633 { ["type"] = "literal", ["value"] = "Bounded truth table does not reduce the one-query tautologies to a random oracle", ["xml:lang"] = "en", }, }, table#3634 { ["itemType"] = table#3635 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3636 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2388435", }, ["subjectLabel"] = table#3637 { ["type"] = "literal", ["value"] = "On arithmetic in the Cantor-Łukasiewicz fuzzy set theory", ["xml:lang"] = "en", }, }, table#3638 { ["itemType"] = table#3639 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3640 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2390327", }, ["subjectLabel"] = table#3641 { ["type"] = "literal", ["value"] = "Formal language identification: query learning vs. gold-style learning", ["xml:lang"] = "en", }, }, table#3642 { ["itemType"] = table#3643 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3644 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2655033", }, ["subjectLabel"] = table#3645 { ["type"] = "literal", ["value"] = "On the complexity of radicals in noncommutative rings", ["xml:lang"] = "en", }, }, table#3646 { ["itemType"] = table#3647 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3648 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2399402", }, ["subjectLabel"] = table#3649 { ["type"] = "literal", ["value"] = "Constructive theory of enumerable species", ["xml:lang"] = "en", }, }, table#3650 { ["itemType"] = table#3651 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3652 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2401539", }, ["subjectLabel"] = table#3653 { ["type"] = "literal", ["value"] = "Spectrum of the field of computable real numbers", ["xml:lang"] = "en", }, }, table#3654 { ["itemType"] = table#3655 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3656 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2401541", }, ["subjectLabel"] = table#3657 { ["type"] = "literal", ["value"] = "Generalized hyperarithmetical computability over structures", ["xml:lang"] = "en", }, }, table#3658 { ["itemType"] = table#3659 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3660 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2401544", }, ["subjectLabel"] = table#3661 { ["type"] = "literal", ["value"] = "The computational power of infinite time Blum-Shub-Smale machines", ["xml:lang"] = "en", }, }, table#3662 { ["itemType"] = table#3663 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3664 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2403574", }, ["subjectLabel"] = table#3665 { ["type"] = "literal", ["value"] = "The semantics of realizability for the constructive set theory based on hyperarithmetical predicates", ["xml:lang"] = "en", }, }, table#3666 { ["itemType"] = table#3667 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3668 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2403641", }, ["subjectLabel"] = table#3669 { ["type"] = "literal", ["value"] = "On images of partial computable functions over computable Polish spaces", ["xml:lang"] = "en", }, }, table#3670 { ["itemType"] = table#3671 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3672 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2403650", }, ["subjectLabel"] = table#3673 { ["type"] = "literal", ["value"] = "Generic Kleene fixed point theorem", ["xml:lang"] = "en", }, }, table#3674 { ["itemType"] = table#3675 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3676 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2662822", }, ["subjectLabel"] = table#3677 { ["type"] = "literal", ["value"] = "Effective wadge hierarchy in computable quasi-Polish spaces", ["xml:lang"] = "en", }, }, table#3678 { ["itemType"] = table#3679 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3680 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2671977", }, ["subjectLabel"] = table#3681 { ["type"] = "literal", ["value"] = "Uniformly computably separable algebras with effectively splittable families of negative congruences", ["xml:lang"] = "en", }, }, table#3682 { ["itemType"] = table#3683 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3684 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2672158", }, ["subjectLabel"] = table#3685 { ["type"] = "literal", ["value"] = "The computational strength of matchings in countable graphs", ["xml:lang"] = "en", }, }, table#3686 { ["itemType"] = table#3687 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3688 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2419119", }, ["subjectLabel"] = table#3689 { ["type"] = "literal", ["value"] = "Intrinsic complexity of partial learning", ["xml:lang"] = "en", }, }, table#3690 { ["itemType"] = table#3691 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3692 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2680581", }, ["subjectLabel"] = table#3693 { ["type"] = "literal", ["value"] = "Rogers semilattices with least and greatest elements in the Ershov hierarchy", ["xml:lang"] = "en", }, }, table#3694 { ["itemType"] = table#3695 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3696 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2682909", }, ["subjectLabel"] = table#3697 { ["type"] = "literal", ["value"] = "Descriptive complexity of \$\\mathsf{qc} \\mathsf{b}_0\$-spaces", ["xml:lang"] = "en", }, }, table#3698 { ["itemType"] = table#3699 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3700 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2687468", }, ["subjectLabel"] = table#3701 { ["type"] = "literal", ["value"] = "Enumeration reducibility and positive reducibility of the numberings of families of arithmetic sets", ["xml:lang"] = "en", }, }, table#3702 { ["itemType"] = table#3703 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3704 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2430013", }, ["subjectLabel"] = table#3705 { ["type"] = "literal", ["value"] = "Deciding the isomorphism problem in classes of unary automatic structures", ["xml:lang"] = "en", }, }, table#3706 { ["itemType"] = table#3707 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3708 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2434601", }, ["subjectLabel"] = table#3709 { ["type"] = "literal", ["value"] = "Degrees of categoricity for superatomic Boolean algebras", ["xml:lang"] = "en", }, }, table#3710 { ["itemType"] = table#3711 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3712 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2436108", }, ["subjectLabel"] = table#3713 { ["type"] = "literal", ["value"] = "Complements for enumeration \$\\Pi_1^0\$-degrees", ["xml:lang"] = "en", }, }, table#3714 { ["itemType"] = table#3715 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3716 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2436619", }, ["subjectLabel"] = table#3717 { ["type"] = "literal", ["value"] = "Domatic partitions of computable graphs", ["xml:lang"] = "en", }, }, table#3718 { ["itemType"] = table#3719 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3720 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2698280", }, ["subjectLabel"] = table#3721 { ["type"] = "literal", ["value"] = "Infinitary action logic with multiplexing", ["xml:lang"] = "en", }, }, table#3722 { ["itemType"] = table#3723 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3724 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2700823", }, ["subjectLabel"] = table#3725 { ["type"] = "literal", ["value"] = "Generalization of Shapiro's theorem to higher arities and noninjective notations", ["xml:lang"] = "en", }, }, table#3726 { ["itemType"] = table#3727 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3728 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2700830", }, ["subjectLabel"] = table#3729 { ["type"] = "literal", ["value"] = "\$sQ_1\$-degrees of computably enumerable sets", ["xml:lang"] = "en", }, }, table#3730 { ["itemType"] = table#3731 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3732 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2453064", }, ["subjectLabel"] = table#3733 { ["type"] = "literal", ["value"] = "Avoiding uniformity in the \$\\Delta_2^0\$ enumeration degrees", ["xml:lang"] = "en", }, }, table#3734 { ["itemType"] = table#3735 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3736 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2460176", }, ["subjectLabel"] = table#3737 { ["type"] = "literal", ["value"] = "The undecidability of propositional adaptive logic", ["xml:lang"] = "en", }, }, table#3738 { ["itemType"] = table#3739 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3740 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2732529", }, ["subjectLabel"] = table#3741 { ["type"] = "literal", ["value"] = "2000 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium 2000", ["xml:lang"] = "en", }, }, table#3742 { ["itemType"] = table#3743 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3744 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2464142", }, ["subjectLabel"] = table#3745 { ["type"] = "literal", ["value"] = "Iterative learning from positive data and negative counterexamples", ["xml:lang"] = "en", }, }, table#3746 { ["itemType"] = table#3747 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3748 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2465036", }, ["subjectLabel"] = table#3749 { ["type"] = "literal", ["value"] = "A general comparison of language learning from examples and from queries", ["xml:lang"] = "en", }, }, table#3750 { ["itemType"] = table#3751 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3752 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2465037", }, ["subjectLabel"] = table#3753 { ["type"] = "literal", ["value"] = "Learning multiple languages in groups", ["xml:lang"] = "en", }, }, table#3754 { ["itemType"] = table#3755 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3756 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2465049", }, ["subjectLabel"] = table#3757 { ["type"] = "literal", ["value"] = "The size of Higman-Haines sets", ["xml:lang"] = "en", }, }, table#3758 { ["itemType"] = table#3759 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3760 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2465639", }, ["subjectLabel"] = table#3761 { ["type"] = "literal", ["value"] = "Learning languages from positive data and a limited number of short counterexamples", ["xml:lang"] = "en", }, }, table#3762 { ["itemType"] = table#3763 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3764 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2747717", }, ["subjectLabel"] = table#3765 { ["type"] = "literal", ["value"] = "On the structures inside truth-table degrees", ["xml:lang"] = "en", }, }, table#3766 { ["itemType"] = table#3767 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3768 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2758051", }, ["subjectLabel"] = table#3769 { ["type"] = "literal", ["value"] = "Can partial indexings be totalized?", ["xml:lang"] = "en", }, }, table#3770 { ["itemType"] = table#3771 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3772 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2758070", }, ["subjectLabel"] = table#3773 { ["type"] = "literal", ["value"] = "On computable automorphisms of the rational numbers", ["xml:lang"] = "en", }, }, table#3774 { ["itemType"] = table#3775 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3776 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2490120", }, ["subjectLabel"] = table#3777 { ["type"] = "literal", ["value"] = "Learning languages from positive data and a finite number of queries", ["xml:lang"] = "en", }, }, table#3778 { ["itemType"] = table#3779 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3780 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2491075", }, ["subjectLabel"] = table#3781 { ["type"] = "literal", ["value"] = "C-quasi-minimal enumeration degrees below \$\\mathbf c'\$", ["xml:lang"] = "en", }, }, table#3782 { ["itemType"] = table#3783 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3784 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2491076", }, ["subjectLabel"] = table#3785 { ["type"] = "literal", ["value"] = "Small \$\\Pi^{0}_{1}\$ classes", ["xml:lang"] = "en", }, }, table#3786 { ["itemType"] = table#3787 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3788 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2497873", }, ["subjectLabel"] = table#3789 { ["type"] = "literal", ["value"] = "Embedding infinitely parallel computation in Newtonian kinematics", ["xml:lang"] = "en", }, }, table#3790 { ["itemType"] = table#3791 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3792 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2497874", }, ["subjectLabel"] = table#3793 { ["type"] = "literal", ["value"] = "A hypercomputational alien", ["xml:lang"] = "en", }, }, table#3794 { ["itemType"] = table#3795 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3796 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2497875", }, ["subjectLabel"] = table#3797 { ["type"] = "literal", ["value"] = "How much can analog and hybrid systems be proved (super-)Turing", ["xml:lang"] = "en", }, }, table#3798 { ["itemType"] = table#3799 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3800 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2497883", }, ["subjectLabel"] = table#3801 { ["type"] = "literal", ["value"] = "The many forms of hypercomputation", ["xml:lang"] = "en", }, }, table#3802 { ["itemType"] = table#3803 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3804 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2500470", }, ["subjectLabel"] = table#3805 { ["type"] = "literal", ["value"] = "A generalization of the second incompleteness theorem and some exceptions to it", ["xml:lang"] = "en", }, }, table#3806 { ["itemType"] = table#3807 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3808 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2500493", }, ["subjectLabel"] = table#3809 { ["type"] = "literal", ["value"] = "On the computational content of the Lawson topology", ["xml:lang"] = "en", }, }, table#3810 { ["itemType"] = table#3811 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3812 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2500523", }, ["subjectLabel"] = table#3813 { ["type"] = "literal", ["value"] = "Variations on U-shaped learning", ["xml:lang"] = "en", }, }, table#3814 { ["itemType"] = table#3815 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3816 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2505132", }, ["subjectLabel"] = table#3817 { ["type"] = "literal", ["value"] = "Constructive logic and the Medvedev lattice", ["xml:lang"] = "en", }, }, table#3818 { ["itemType"] = table#3819 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3820 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2793914", }, ["subjectLabel"] = table#3821 { ["type"] = "literal", ["value"] = "Weakly precomplete computably enumerable equivalence relations", ["xml:lang"] = "en", }, }, table#3822 { ["itemType"] = table#3823 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3824 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2795307", }, ["subjectLabel"] = table#3825 { ["type"] = "literal", ["value"] = "DEMUTH’S PATH TO RANDOMNESS", ["xml:lang"] = "en", }, }, table#3826 { ["itemType"] = table#3827 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3828 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2516585", }, ["subjectLabel"] = table#3829 { ["type"] = "literal", ["value"] = "The complexity of the dependence operator", ["xml:lang"] = "en", }, }, table#3830 { ["itemType"] = table#3831 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3832 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2805159", }, ["subjectLabel"] = table#3833 { ["type"] = "literal", ["value"] = "Semi-decidability of May, Must and Probabilistic Testing in a Higher-type Setting", ["xml:lang"] = "en", }, }, table#3834 { ["itemType"] = table#3835 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3836 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2817095", }, ["subjectLabel"] = table#3837 { ["type"] = "literal", ["value"] = "Comments on some theories of fuzzy computation", ["xml:lang"] = "en", }, }, table#3838 { ["itemType"] = table#3839 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3840 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2532605", }, ["subjectLabel"] = table#3841 { ["type"] = "literal", ["value"] = "Towards a theory of semantics and compilers for programming languages", ["xml:lang"] = "en", }, }, table#3842 { ["itemType"] = table#3843 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3844 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2821693", }, ["subjectLabel"] = table#3845 { ["type"] = "literal", ["value"] = "Investigations Concerning the Structure of Complete Sets", ["xml:lang"] = "en", }, }, table#3846 { ["itemType"] = table#3847 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3848 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2537310", }, ["subjectLabel"] = table#3849 { ["type"] = "literal", ["value"] = "Beziehungen zwischen gewissen Klassen effektiv topologischer Räume", ["xml:lang"] = "en", }, }, table#3850 { ["itemType"] = table#3851 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3852 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2540268", }, ["subjectLabel"] = table#3853 { ["type"] = "literal", ["value"] = "What makes some language theory problems undecidable", ["xml:lang"] = "en", }, }, table#3854 { ["itemType"] = table#3855 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3856 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2542514", }, ["subjectLabel"] = table#3857 { ["type"] = "literal", ["value"] = "The Shoenfield absoluteness lemma", ["xml:lang"] = "en", }, }, table#3858 { ["itemType"] = table#3859 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3860 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2542725", }, ["subjectLabel"] = table#3861 { ["type"] = "literal", ["value"] = "On index sets", ["xml:lang"] = "en", }, }, table#3862 { ["itemType"] = table#3863 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3864 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2543321", }, ["subjectLabel"] = table#3865 { ["type"] = "literal", ["value"] = "An answer to a question by P. R. Young", ["xml:lang"] = "en", }, }, table#3866 { ["itemType"] = table#3867 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3868 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2544777", }, ["subjectLabel"] = table#3869 { ["type"] = "literal", ["value"] = "Two theorems on recursively enumerable sets", ["xml:lang"] = "en", }, }, table#3870 { ["itemType"] = table#3871 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3872 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2545514", }, ["subjectLabel"] = table#3873 { ["type"] = "literal", ["value"] = "The enumerability and invariance of complexity classes", ["xml:lang"] = "en", }, }, table#3874 { ["itemType"] = table#3875 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3876 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2546043", }, ["subjectLabel"] = table#3877 { ["type"] = "literal", ["value"] = "On the structure of subrecursive degrees", ["xml:lang"] = "en", }, }, table#3878 { ["itemType"] = table#3879 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3880 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2546302", }, ["subjectLabel"] = table#3881 { ["type"] = "literal", ["value"] = "Three theorems concerning principal AFLs", ["xml:lang"] = "en", }, }, table#3882 { ["itemType"] = table#3883 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3884 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2546770", }, ["subjectLabel"] = table#3885 { ["type"] = "literal", ["value"] = "Subrecursive programming languages. II. On program size", ["xml:lang"] = "en", }, }, table#3886 { ["itemType"] = table#3887 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3888 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2830275", }, ["subjectLabel"] = table#3889 { ["type"] = "literal", ["value"] = "Intrinsic Complexity of Partial Learning", ["xml:lang"] = "en", }, }, table#3890 { ["itemType"] = table#3891 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3892 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2547889", }, ["subjectLabel"] = table#3893 { ["type"] = "literal", ["value"] = "On the reducibility of \$\\Pi_ 1^ 1\$ sets", ["xml:lang"] = "en", }, }, table#3894 { ["itemType"] = table#3895 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3896 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2548248", }, ["subjectLabel"] = table#3897 { ["type"] = "literal", ["value"] = "Hyper-hypersimple \$m\$-degrees", ["xml:lang"] = "en", }, }, table#3898 { ["itemType"] = table#3899 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3900 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2548594", }, ["subjectLabel"] = table#3901 { ["type"] = "literal", ["value"] = "Abstract computational complexity and cycling computations", ["xml:lang"] = "en", }, }, table#3902 { ["itemType"] = table#3903 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3904 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2551104", }, ["subjectLabel"] = table#3905 { ["type"] = "literal", ["value"] = "On a hierarchy of sets. III", ["xml:lang"] = "en", }, }, table#3906 { ["itemType"] = table#3907 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3908 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2551463", }, ["subjectLabel"] = table#3909 { ["type"] = "literal", ["value"] = "The use of lists in the study of undecidable problems in automata theory", ["xml:lang"] = "en", }, }, table#3910 { ["itemType"] = table#3911 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3912 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2553432", }, ["subjectLabel"] = table#3913 { ["type"] = "literal", ["value"] = "On \$m\$-degrees of recursively enumerable sets", ["xml:lang"] = "en", }, }, table#3914 { ["itemType"] = table#3915 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3916 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2835616", }, ["subjectLabel"] = table#3917 { ["type"] = "literal", ["value"] = "Priced Learning", ["xml:lang"] = "en", }, }, table#3918 { ["itemType"] = table#3919 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3920 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2554653", }, ["subjectLabel"] = table#3921 { ["type"] = "literal", ["value"] = "Complexity of winning strategies", ["xml:lang"] = "en", }, }, table#3922 { ["itemType"] = table#3923 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3924 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2556220", }, ["subjectLabel"] = table#3925 { ["type"] = "literal", ["value"] = "Effective operators with no strong gaps", ["xml:lang"] = "en", }, }, table#3926 { ["itemType"] = table#3927 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3928 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2557798", }, ["subjectLabel"] = table#3929 { ["type"] = "literal", ["value"] = "Free and almost-free subsemigroups of a free semigroup", ["xml:lang"] = "en", }, }, table#3930 { ["itemType"] = table#3931 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3932 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2558862", }, ["subjectLabel"] = table#3933 { ["type"] = "literal", ["value"] = "Combinatorial systems. I: Cylindrical problems", ["xml:lang"] = "en", }, }, table#3934 { ["itemType"] = table#3935 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3936 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2559256", }, ["subjectLabel"] = table#3937 { ["type"] = "literal", ["value"] = "Valutazione comparativa di una classe di metodi iterativi per equazioni in spazi di Banach", ["xml:lang"] = "en", }, }, table#3938 { ["itemType"] = table#3939 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3940 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2559259", }, ["subjectLabel"] = table#3941 { ["type"] = "literal", ["value"] = "Subrecursive program schemata I P II. I: Undecidable equivalence problems. II: Decidable equivalence problems", ["xml:lang"] = "en", }, }, table#3942 { ["itemType"] = table#3943 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3944 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2560211", }, ["subjectLabel"] = table#3945 { ["type"] = "literal", ["value"] = "Significance arithmetic: The carrying algorithm", ["xml:lang"] = "en", }, }, table#3946 { ["itemType"] = table#3947 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3948 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2560399", }, ["subjectLabel"] = table#3949 { ["type"] = "literal", ["value"] = "On effectively hypersimple sets", ["xml:lang"] = "en", }, }, table#3950 { ["itemType"] = table#3951 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3952 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2560401", }, ["subjectLabel"] = table#3953 { ["type"] = "literal", ["value"] = "Maximal sets in \$\\alpha\$-recursion theory", ["xml:lang"] = "en", }, }, table#3954 { ["itemType"] = table#3955 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3956 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2561587", }, ["subjectLabel"] = table#3957 { ["type"] = "literal", ["value"] = "On the subalgebras of R. Robinson's algebras", ["xml:lang"] = "en", }, }, table#3958 { ["itemType"] = table#3959 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3960 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2561588", }, ["subjectLabel"] = table#3961 { ["type"] = "literal", ["value"] = "The index sets of m-degrees", ["xml:lang"] = "en", }, }, table#3962 { ["itemType"] = table#3963 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3964 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2842589", }, ["subjectLabel"] = table#3965 { ["type"] = "literal", ["value"] = "Classes of Timed Automata and the Undecidability of Universality", ["xml:lang"] = "en", }, }, table#3966 { ["itemType"] = table#3967 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3968 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2842635", }, ["subjectLabel"] = table#3969 { ["type"] = "literal", ["value"] = "The Value-Passing Calculus", ["xml:lang"] = "en", }, }, table#3970 { ["itemType"] = table#3971 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3972 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2565991", }, ["subjectLabel"] = table#3973 { ["type"] = "literal", ["value"] = "Sets without subsets of higher many-one degree", ["xml:lang"] = "en", }, }, table#3974 { ["itemType"] = table#3975 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3976 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2568460", }, ["subjectLabel"] = table#3977 { ["type"] = "literal", ["value"] = "On learning to coordinate: random bits help, insightful normal forms, and competency isomorphisms", ["xml:lang"] = "en", }, }, table#3978 { ["itemType"] = table#3979 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3980 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2575753", }, ["subjectLabel"] = table#3981 { ["type"] = "literal", ["value"] = "All superlinear inverse schemes are coNP-hard", ["xml:lang"] = "en", }, }, table#3982 { ["itemType"] = table#3983 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3984 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2577367", }, ["subjectLabel"] = table#3985 { ["type"] = "literal", ["value"] = "On \$R\$-universal functions", ["xml:lang"] = "en", }, }, table#3986 { ["itemType"] = table#3987 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3988 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2581361", }, ["subjectLabel"] = table#3989 { ["type"] = "literal", ["value"] = "Learning erasing pattern languages with queries", ["xml:lang"] = "en", }, }, table#3990 { ["itemType"] = table#3991 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3992 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2581538", }, ["subjectLabel"] = table#3993 { ["type"] = "literal", ["value"] = "Relations between Gold-style learning and query learning", ["xml:lang"] = "en", }, }, table#3994 { ["itemType"] = table#3995 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#3996 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2869784", }, ["subjectLabel"] = table#3997 { ["type"] = "literal", ["value"] = "Computational classification of cellular automata", ["xml:lang"] = "en", }, }, table#3998 { ["itemType"] = table#3999 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4000 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2873496", }, ["subjectLabel"] = table#4001 { ["type"] = "literal", ["value"] = "TAMING THE INCOMPUTABLE, RECONSTRUCTING THE NONCONSTRUCTIVE AND DECIDING THE UNDECIDABLE IN MATHEMATICAL ECONOMICS", ["xml:lang"] = "en", }, }, table#4002 { ["itemType"] = table#4003 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4004 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3159399", }, ["subjectLabel"] = table#4005 { ["type"] = "literal", ["value"] = "Is the Mandelbrot set computable?", ["xml:lang"] = "en", }, }, table#4006 { ["itemType"] = table#4007 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4008 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3159401", }, ["subjectLabel"] = table#4009 { ["type"] = "literal", ["value"] = "Hierarchies in?-spaces and applications", ["xml:lang"] = "en", }, }, table#4010 { ["itemType"] = table#4011 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4012 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3160562", }, ["subjectLabel"] = table#4013 { ["type"] = "literal", ["value"] = "On revision operators", ["xml:lang"] = "en", }, }, table#4014 { ["itemType"] = table#4015 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4016 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3161629", }, ["subjectLabel"] = table#4017 { ["type"] = "literal", ["value"] = "Kleene's Amazing Second Recursion Theorem", ["xml:lang"] = "en", }, }, table#4018 { ["itemType"] = table#4019 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4020 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2891307", }, ["subjectLabel"] = table#4021 { ["type"] = "literal", ["value"] = "Learning Families of Closed Sets in Matroids", ["xml:lang"] = "en", }, }, table#4022 { ["itemType"] = table#4023 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4024 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2891309", }, ["subjectLabel"] = table#4025 { ["type"] = "literal", ["value"] = "Demuth’s Path to Randomness", ["xml:lang"] = "en", }, }, table#4026 { ["itemType"] = table#4027 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4028 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3163663", }, ["subjectLabel"] = table#4029 { ["type"] = "literal", ["value"] = "Reverse Mathematics: The Playground of Logic", ["xml:lang"] = "en", }, }, table#4030 { ["itemType"] = table#4031 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4032 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2893281", }, ["subjectLabel"] = table#4033 { ["type"] = "literal", ["value"] = "A Survey of Mučnik and Medvedev Degrees", ["xml:lang"] = "en", }, }, table#4034 { ["itemType"] = table#4035 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4036 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3174639", }, ["subjectLabel"] = table#4037 { ["type"] = "literal", ["value"] = "Alan Turing and the Foundations of Computable Analysis", ["xml:lang"] = "en", }, }, table#4038 { ["itemType"] = table#4039 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4040 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3457723", }, ["subjectLabel"] = table#4041 { ["type"] = "literal", ["value"] = "Reflective Oracles: A Foundation for Game Theory in Artificial Intelligence", ["xml:lang"] = "en", }, }, table#4042 { ["itemType"] = table#4043 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4044 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2909093", }, ["subjectLabel"] = table#4045 { ["type"] = "literal", ["value"] = "THE COMPLEXITY OF REGULAR(-LIKE) EXPRESSIONS", ["xml:lang"] = "en", }, }, table#4046 { ["itemType"] = table#4047 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4048 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3188262", }, ["subjectLabel"] = table#4049 { ["type"] = "literal", ["value"] = "Program Size Complexity of Correction Grammars in the Ershov Hierarchy", ["xml:lang"] = "en", }, }, table#4050 { ["itemType"] = table#4051 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4052 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3188263", }, ["subjectLabel"] = table#4053 { ["type"] = "literal", ["value"] = "Automorphism Groups of Substructure Lattices of Vector Spaces in Computable Algebra", ["xml:lang"] = "en", }, }, table#4054 { ["itemType"] = table#4055 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4056 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2921020", }, ["subjectLabel"] = table#4057 { ["type"] = "literal", ["value"] = "UNIVERSAL COMPUTABLY ENUMERABLE EQUIVALENCE RELATIONS", ["xml:lang"] = "en", }, }, table#4058 { ["itemType"] = table#4059 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4060 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2921021", }, ["subjectLabel"] = table#4061 { ["type"] = "literal", ["value"] = "THE STRENGTH OF RAMSEY’S THEOREM FOR COLORING RELATIVELY LARGE SETS", ["xml:lang"] = "en", }, }, table#4062 { ["itemType"] = table#4063 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4064 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2922848", }, ["subjectLabel"] = table#4065 { ["type"] = "literal", ["value"] = "On the normality of numbers to different bases", ["xml:lang"] = "en", }, }, table#4066 { ["itemType"] = table#4067 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4068 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3195689", }, ["subjectLabel"] = table#4069 { ["type"] = "literal", ["value"] = "Immune Systems in Computer Virology", ["xml:lang"] = "en", }, }, table#4070 { ["itemType"] = table#4071 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4072 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3195700", }, ["subjectLabel"] = table#4073 { ["type"] = "literal", ["value"] = "Rice’s Theorem in Effectively Enumerable Topological Spaces", ["xml:lang"] = "en", }, }, table#4074 { ["itemType"] = table#4075 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4076 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3195711", }, ["subjectLabel"] = table#4077 { ["type"] = "literal", ["value"] = "Towards the Effective Descriptive Set Theory", ["xml:lang"] = "en", }, }, table#4078 { ["itemType"] = table#4079 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4080 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3197819", }, ["subjectLabel"] = table#4081 { ["type"] = "literal", ["value"] = "A theory of formal truth arithmetically equivalent to ID₁", ["xml:lang"] = "en", }, }, table#4082 { ["itemType"] = table#4083 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4084 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3199409", }, ["subjectLabel"] = table#4085 { ["type"] = "literal", ["value"] = "Creativeness and completeness in recursion categories of partial recursive operators", ["xml:lang"] = "en", }, }, table#4086 { ["itemType"] = table#4087 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4088 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2929348", }, ["subjectLabel"] = table#4089 { ["type"] = "literal", ["value"] = "Unpredictability and Computational Irreducibility", ["xml:lang"] = "en", }, }, table#4090 { ["itemType"] = table#4091 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4092 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3478380", }, ["subjectLabel"] = table#4093 { ["type"] = "literal", ["value"] = "Annual Meeting of the Association for Symbolic Logic, Los Angeles, 1989", ["xml:lang"] = "en", }, }, table#4094 { ["itemType"] = table#4095 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4096 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3478382", }, ["subjectLabel"] = table#4097 { ["type"] = "literal", ["value"] = "Meeting of the Association for Symbolic Logic, Chicago, 1989", ["xml:lang"] = "en", }, }, table#4098 { ["itemType"] = table#4099 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4100 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3206935", }, ["subjectLabel"] = table#4101 { ["type"] = "literal", ["value"] = "Reducibilities in two models for combinatory logic", ["xml:lang"] = "en", }, }, table#4102 { ["itemType"] = table#4103 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4104 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3481688", }, ["subjectLabel"] = table#4105 { ["type"] = "literal", ["value"] = "Some remarks on the algebraic structure of the Medvedev Lattice", ["xml:lang"] = "en", }, }, table#4106 { ["itemType"] = table#4107 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4108 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3483272", }, ["subjectLabel"] = table#4109 { ["type"] = "literal", ["value"] = "Definability via enumerations", ["xml:lang"] = "en", }, }, table#4110 { ["itemType"] = table#4111 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4112 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2944899", }, ["subjectLabel"] = table#4113 { ["type"] = "literal", ["value"] = "Learning from Positive Data and Negative Counterexamples: A Survey", ["xml:lang"] = "en", }, }, table#4114 { ["itemType"] = table#4115 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4116 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2947182", }, ["subjectLabel"] = table#4117 { ["type"] = "literal", ["value"] = "Composition Over the Natural Number Ordering with an Extra Binary Relation", ["xml:lang"] = "en", }, }, table#4118 { ["itemType"] = table#4119 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4120 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3495668", }, ["subjectLabel"] = table#4121 { ["type"] = "literal", ["value"] = "PROBLEMS WITH COMPLEXITY IN GOLD'S PARADIGM OF INDUCTION Part I: Dynamic Complexity", ["xml:lang"] = "en", }, }, table#4122 { ["itemType"] = table#4123 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4124 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2951897", }, ["subjectLabel"] = table#4125 { ["type"] = "literal", ["value"] = "Mass problems and density", ["xml:lang"] = "en", }, }, table#4126 { ["itemType"] = table#4127 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4128 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3049813", }, ["subjectLabel"] = table#4129 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3049813", }, }, table#4130 { ["itemType"] = table#4131 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4132 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3503648", }, ["subjectLabel"] = table#4133 { ["type"] = "literal", ["value"] = "On Sequences with Non-learnable Subsequences", ["xml:lang"] = "en", }, }, table#4134 { ["itemType"] = table#4135 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4136 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3503754", }, ["subjectLabel"] = table#4137 { ["type"] = "literal", ["value"] = "On the structure of the Medvedev lattice", ["xml:lang"] = "en", }, }, table#4138 { ["itemType"] = table#4139 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4140 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2906573", }, ["subjectLabel"] = table#4141 { ["type"] = "literal", ["value"] = "Discrete Transfinite Computation", ["xml:lang"] = "en", }, }, table#4142 { ["itemType"] = table#4143 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4144 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3507436", }, ["subjectLabel"] = table#4145 { ["type"] = "literal", ["value"] = "The Shrinking Property for NP and coNP", ["xml:lang"] = "en", }, }, table#4146 { ["itemType"] = table#4147 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4148 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3507466", }, ["subjectLabel"] = table#4149 { ["type"] = "literal", ["value"] = "Upper Semilattices in Many-One Degrees", ["xml:lang"] = "en", }, }, table#4150 { ["itemType"] = table#4151 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4152 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2959176", }, ["subjectLabel"] = table#4153 { ["type"] = "literal", ["value"] = "First-order combinatorics and model-theoretical properties that can be distinct for mutually interpretable theories", ["xml:lang"] = "en", }, }, table#4154 { ["itemType"] = table#4155 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4156 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2963952", }, ["subjectLabel"] = table#4157 { ["type"] = "literal", ["value"] = "Continuity in Semantic Theories of Programming", ["xml:lang"] = "en", }, }, table#4158 { ["itemType"] = table#4159 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4160 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2963957", }, ["subjectLabel"] = table#4161 { ["type"] = "literal", ["value"] = "Satisfying Predicates: Kleene's Proof of the Hilbert–Bernays Theorem", ["xml:lang"] = "en", }, }, table#4162 { ["itemType"] = table#4163 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4164 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3515461", }, ["subjectLabel"] = table#4165 { ["type"] = "literal", ["value"] = "Hierarchies of function classes defined by the first-value operator", ["xml:lang"] = "en", }, }, table#4166 { ["itemType"] = table#4167 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4168 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3520048", }, ["subjectLabel"] = table#4169 { ["type"] = "literal", ["value"] = "Feasible Iteration of Feasible Learning Functionals", ["xml:lang"] = "en", }, }, table#4170 { ["itemType"] = table#4171 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4172 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3520049", }, ["subjectLabel"] = table#4173 { ["type"] = "literal", ["value"] = "Parallelism Increases Iterative Learning Power", ["xml:lang"] = "en", }, }, table#4174 { ["itemType"] = table#4175 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4176 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3520051", }, ["subjectLabel"] = table#4177 { ["type"] = "literal", ["value"] = "Learning in Friedberg Numberings", ["xml:lang"] = "en", }, }, table#4178 { ["itemType"] = table#4179 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4180 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3520064", }, ["subjectLabel"] = table#4181 { ["type"] = "literal", ["value"] = "One-Shot Learners Using Negative Counterexamples and Nearest Positive Examples", ["xml:lang"] = "en", }, }, table#4182 { ["itemType"] = table#4183 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4184 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3520074", }, ["subjectLabel"] = table#4185 { ["type"] = "literal", ["value"] = "On Calibration Error of Randomized Forecasting Algorithms", ["xml:lang"] = "en", }, }, table#4186 { ["itemType"] = table#4187 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4188 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2970967", }, ["subjectLabel"] = table#4189 { ["type"] = "literal", ["value"] = "On Constructive Nilpotent Groups", ["xml:lang"] = "en", }, }, table#4190 { ["itemType"] = table#4191 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4192 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2970971", }, ["subjectLabel"] = table#4193 { ["type"] = "literal", ["value"] = "A Survey on Universal Computably Enumerable Equivalence Relations", ["xml:lang"] = "en", }, }, table#4194 { ["itemType"] = table#4195 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4196 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2970973", }, ["subjectLabel"] = table#4197 { ["type"] = "literal", ["value"] = "A Survey of Results on the d-c.e. and n-c.e. Degrees", ["xml:lang"] = "en", }, }, table#4198 { ["itemType"] = table#4199 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4200 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2970981", }, ["subjectLabel"] = table#4201 { ["type"] = "literal", ["value"] = "Permutations of the Integers Induce only the Trivial Automorphism of the Turing Degrees", ["xml:lang"] = "en", }, }, table#4202 { ["itemType"] = table#4203 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4204 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2970986", }, ["subjectLabel"] = table#4205 { ["type"] = "literal", ["value"] = "Turing Degrees and Muchnik Degrees of Recursively Bounded DNR Functions", ["xml:lang"] = "en", }, }, table#4206 { ["itemType"] = table#4207 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4208 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3521596", }, ["subjectLabel"] = table#4209 { ["type"] = "literal", ["value"] = "MASS PROBLEMS AND HYPERARITHMETICITY", ["xml:lang"] = "en", }, }, table#4210 { ["itemType"] = table#4211 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4212 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2973253", }, ["subjectLabel"] = table#4213 { ["type"] = "literal", ["value"] = "Lambda theories allowing terms with a finite number of fixed points", ["xml:lang"] = "en", }, }, table#4214 { ["itemType"] = table#4215 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4216 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3526411", }, ["subjectLabel"] = table#4217 { ["type"] = "literal", ["value"] = "Some Algebraic Properties of Machine Poset of Infinite Words", ["xml:lang"] = "en", }, }, table#4218 { ["itemType"] = table#4219 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4220 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3529934", }, ["subjectLabel"] = table#4221 { ["type"] = "literal", ["value"] = "Iterative Learning of Simple External Contextual Languages", ["xml:lang"] = "en", }, }, table#4222 { ["itemType"] = table#4223 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4224 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3529936", }, ["subjectLabel"] = table#4225 { ["type"] = "literal", ["value"] = "Dynamically Delayed Postdictive Completeness and Consistency in Learning", ["xml:lang"] = "en", }, }, table#4226 { ["itemType"] = table#4227 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4228 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3529937", }, ["subjectLabel"] = table#4229 { ["type"] = "literal", ["value"] = "Dynamic Modeling in Inductive Inference", ["xml:lang"] = "en", }, }, table#4230 { ["itemType"] = table#4231 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4232 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3295154", }, ["subjectLabel"] = table#4233 { ["type"] = "literal", ["value"] = "Well-Quasi Orders and Hierarchy Theory", ["xml:lang"] = "en", }, }, table#4234 { ["itemType"] = table#4235 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4236 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3305316", }, ["subjectLabel"] = table#4237 { ["type"] = "literal", ["value"] = "Extensions of Hilbert’s Tenth Problem: Definability and Decidability in Number Theory", ["xml:lang"] = "en", }, }, table#4238 { ["itemType"] = table#4239 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4240 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3305318", }, ["subjectLabel"] = table#4241 { ["type"] = "literal", ["value"] = "Hyperarithmetical Sets", ["xml:lang"] = "en", }, }, table#4242 { ["itemType"] = table#4243 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4244 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3007621", }, ["subjectLabel"] = table#4245 { ["type"] = "literal", ["value"] = "Kolmogorov Complexity as a Language", ["xml:lang"] = "en", }, }, table#4246 { ["itemType"] = table#4247 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4248 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3309825", }, ["subjectLabel"] = table#4249 { ["type"] = "literal", ["value"] = "Closure properties of almost-finiteness classes in recursive function theory", ["xml:lang"] = "en", }, }, table#4250 { ["itemType"] = table#4251 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4252 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3309827", }, ["subjectLabel"] = table#4253 { ["type"] = "literal", ["value"] = "Classifying positive equivalence relations", ["xml:lang"] = "en", }, }, table#4254 { ["itemType"] = table#4255 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4256 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3309828", }, ["subjectLabel"] = table#4257 { ["type"] = "literal", ["value"] = "Definability of r. e. sets in a class of recursion theoretic structures", ["xml:lang"] = "en", }, }, table#4258 { ["itemType"] = table#4259 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4260 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3310596", }, ["subjectLabel"] = table#4261 { ["type"] = "literal", ["value"] = "Remarks on the development of computability", ["xml:lang"] = "en", }, }, table#4262 { ["itemType"] = table#4263 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4264 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3310597", }, ["subjectLabel"] = table#4265 { ["type"] = "literal", ["value"] = "On the definitions of some complexity classes of real numbers", ["xml:lang"] = "en", }, }, table#4266 { ["itemType"] = table#4267 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4268 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3010414", }, ["subjectLabel"] = table#4269 { ["type"] = "literal", ["value"] = "On the Amount of Nonconstructivity in Learning Recursive Functions", ["xml:lang"] = "en", }, }, table#4270 { ["itemType"] = table#4271 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4272 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3011104", }, ["subjectLabel"] = table#4273 { ["type"] = "literal", ["value"] = "Defining Integers", ["xml:lang"] = "en", }, }, table#4274 { ["itemType"] = table#4275 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4276 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3011108", }, ["subjectLabel"] = table#4277 { ["type"] = "literal", ["value"] = "Robust separations in inductive inference", ["xml:lang"] = "en", }, }, table#4278 { ["itemType"] = table#4279 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4280 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3313844", }, ["subjectLabel"] = table#4281 { ["type"] = "literal", ["value"] = "Meeting of the Association for Symbolic Logic, Madison, 1982", ["xml:lang"] = "en", }, }, table#4282 { ["itemType"] = table#4283 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4284 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3313852", }, ["subjectLabel"] = table#4285 { ["type"] = "literal", ["value"] = "Index sets and degrees of unsolvability", ["xml:lang"] = "en", }, }, table#4286 { ["itemType"] = table#4287 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4288 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3320340", }, ["subjectLabel"] = table#4289 { ["type"] = "literal", ["value"] = "On the interpretation of combinators with weak reduction", ["xml:lang"] = "en", }, }, table#4290 { ["itemType"] = table#4291 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4292 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3323936", }, ["subjectLabel"] = table#4293 { ["type"] = "literal", ["value"] = "Kleene index sets and functional m-degrees", ["xml:lang"] = "en", }, }, table#4294 { ["itemType"] = table#4295 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4296 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3331211", }, ["subjectLabel"] = table#4297 { ["type"] = "literal", ["value"] = "Relativized polynomial hierarchies extending two levels", ["xml:lang"] = "en", }, }, table#4298 { ["itemType"] = table#4299 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4300 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3331214", }, ["subjectLabel"] = table#4301 { ["type"] = "literal", ["value"] = "Recursive isomorphism types of recursive Boolean algebras", ["xml:lang"] = "en", }, }, table#4302 { ["itemType"] = table#4303 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4304 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3331215", }, ["subjectLabel"] = table#4305 { ["type"] = "literal", ["value"] = "Recursive Boolean algebras with recursive atoms", ["xml:lang"] = "en", }, }, table#4306 { ["itemType"] = table#4307 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4308 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3039336", }, ["subjectLabel"] = table#4309 { ["type"] = "literal", ["value"] = "R. e. presented linear orders", ["xml:lang"] = "en", }, }, table#4310 { ["itemType"] = table#4311 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4312 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3041177", }, ["subjectLabel"] = table#4313 { ["type"] = "literal", ["value"] = "Forcing and reducibilities", ["xml:lang"] = "en", }, }, table#4314 { ["itemType"] = table#4315 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4316 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3043119", }, ["subjectLabel"] = table#4317 { ["type"] = "literal", ["value"] = "Expansions of models and turing degrees", ["xml:lang"] = "en", }, }, table#4318 { ["itemType"] = table#4319 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4320 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3043134", }, ["subjectLabel"] = table#4321 { ["type"] = "literal", ["value"] = "Analytic sets having incomparable kleene degrees", ["xml:lang"] = "en", }, }, table#4322 { ["itemType"] = table#4323 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4324 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3043140", }, ["subjectLabel"] = table#4325 { ["type"] = "literal", ["value"] = "Church's thesis without tears", ["xml:lang"] = "en", }, }, table#4326 { ["itemType"] = table#4327 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4328 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3345786", }, ["subjectLabel"] = table#4329 { ["type"] = "literal", ["value"] = "A relation between correctness and randomness in the computation of probabilistic algorithms", ["xml:lang"] = "en", }, }, table#4330 { ["itemType"] = table#4331 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4332 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3060205", }, ["subjectLabel"] = table#4333 { ["type"] = "literal", ["value"] = "Function operators spanning the arithmetical and the polynomial hierarchy", ["xml:lang"] = "en", }, }, table#4334 { ["itemType"] = table#4335 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4336 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3360391", }, ["subjectLabel"] = table#4337 { ["type"] = "literal", ["value"] = "The constructive theory of torsion-free abelian groups", ["xml:lang"] = "en", }, }, table#4338 { ["itemType"] = table#4339 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4340 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3370625", }, ["subjectLabel"] = table#4341 { ["type"] = "literal", ["value"] = "Mass Problems and Randomness", ["xml:lang"] = "en", }, }, table#4342 { ["itemType"] = table#4343 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4344 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3379460", }, ["subjectLabel"] = table#4345 { ["type"] = "literal", ["value"] = "ON EXTENSIONS OF EMBEDDINGS INTO THE ENUMERATION DEGREES OF THE ${\\Sigma_2^0}$-SETS", ["xml:lang"] = "en", }, }, table#4346 { ["itemType"] = table#4347 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4348 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3083132", }, ["subjectLabel"] = table#4349 { ["type"] = "literal", ["value"] = "Weihrauch degrees, omniscience principles and weak computability", ["xml:lang"] = "en", }, }, table#4350 { ["itemType"] = table#4351 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4352 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3083466", }, ["subjectLabel"] = table#4353 { ["type"] = "literal", ["value"] = "Effective Choice and Boundedness Principles in Computable Analysis", ["xml:lang"] = "en", }, }, table#4354 { ["itemType"] = table#4355 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4356 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3088297", }, ["subjectLabel"] = table#4357 { ["type"] = "literal", ["value"] = "Reactive Turing Machines", ["xml:lang"] = "en", }, }, table#4358 { ["itemType"] = table#4359 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4360 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3395140", }, ["subjectLabel"] = table#4361 { ["type"] = "literal", ["value"] = "ASPECTS OF PERSISTENT COMPUTATIONS", ["xml:lang"] = "en", }, }, table#4362 { ["itemType"] = table#4363 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4364 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3096087", }, ["subjectLabel"] = table#4365 { ["type"] = "literal", ["value"] = "Low sets without subsets of higher many-one degree", ["xml:lang"] = "en", }, }, table#4366 { ["itemType"] = table#4367 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4368 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3399191", }, ["subjectLabel"] = table#4369 { ["type"] = "literal", ["value"] = "Intrinsic bounds on complexity and definability at limit levels", ["xml:lang"] = "en", }, }, table#4370 { ["itemType"] = table#4371 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4372 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3401476", }, ["subjectLabel"] = table#4373 { ["type"] = "literal", ["value"] = "WHEN CHURCH-ROSSER BECOMES CONTEXT FREE", ["xml:lang"] = "en", }, }, table#4374 { ["itemType"] = table#4375 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4376 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3416113", }, ["subjectLabel"] = table#4377 { ["type"] = "literal", ["value"] = "A Buchholz derivation system for the ordinal analysis of KP + Π₃-reflection", ["xml:lang"] = "en", }, }, table#4378 { ["itemType"] = table#4379 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4380 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3117545", }, ["subjectLabel"] = table#4381 { ["type"] = "literal", ["value"] = "Some problems in automata theory which depend on the models of set theory", ["xml:lang"] = "en", }, }, table#4382 { ["itemType"] = table#4383 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4384 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3426574", }, ["subjectLabel"] = table#4385 { ["type"] = "literal", ["value"] = "Elementary differences between the (2_p)-C. E. and the (2_p +1)-c. e. enumeration degrees", ["xml:lang"] = "en", }, }, table#4386 { ["itemType"] = table#4387 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4388 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3128477", }, ["subjectLabel"] = table#4389 { ["type"] = "literal", ["value"] = "Noncappable enumeration degrees below 0_e^′", ["xml:lang"] = "en", }, }, table#4390 { ["itemType"] = table#4391 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4392 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3430937", }, ["subjectLabel"] = table#4393 { ["type"] = "literal", ["value"] = "Classification from a Computable Viewpoint", ["xml:lang"] = "en", }, }, table#4394 { ["itemType"] = table#4395 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4396 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q2875229", }, ["subjectLabel"] = table#4397 { ["type"] = "literal", ["value"] = "On the complexity of stream equality", ["xml:lang"] = "en", }, }, table#4398 { ["itemType"] = table#4399 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4400 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3149981", }, ["subjectLabel"] = table#4401 { ["type"] = "literal", ["value"] = "Splitting properties of n-c.e. enumeration degrees", ["xml:lang"] = "en", }, }, table#4402 { ["itemType"] = table#4403 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4404 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3960832", }, ["subjectLabel"] = table#4405 { ["type"] = "literal", ["value"] = "Charakterisierung der Aufzählungsreduzierbarkeit", ["xml:lang"] = "en", }, }, table#4406 { ["itemType"] = table#4407 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4408 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3697017", }, ["subjectLabel"] = table#4409 { ["type"] = "literal", ["value"] = "Two theorems on degrees of models of true arithmetic", ["xml:lang"] = "en", }, }, table#4410 { ["itemType"] = table#4411 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4412 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3962980", }, ["subjectLabel"] = table#4413 { ["type"] = "literal", ["value"] = "Recursively enumerable generic sets", ["xml:lang"] = "en", }, }, table#4414 { ["itemType"] = table#4415 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4416 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3699683", }, ["subjectLabel"] = table#4417 { ["type"] = "literal", ["value"] = "Universal recursion theoretic properties of r.e. preordered structures", ["xml:lang"] = "en", }, }, table#4418 { ["itemType"] = table#4419 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4420 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3701408", }, ["subjectLabel"] = table#4421 { ["type"] = "literal", ["value"] = "Definable structures in the lattice of recursively enumerable sets", ["xml:lang"] = "en", }, }, table#4422 { ["itemType"] = table#4423 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4424 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3701410", }, ["subjectLabel"] = table#4425 { ["type"] = "literal", ["value"] = "A hierarchy of families of recursively enumerable degrees", ["xml:lang"] = "en", }, }, table#4426 { ["itemType"] = table#4427 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4428 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3968913", }, ["subjectLabel"] = table#4429 { ["type"] = "literal", ["value"] = "Splitting theorems for speed-up related to order of enumeration", ["xml:lang"] = "en", }, }, table#4430 { ["itemType"] = table#4431 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4432 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3710516", }, ["subjectLabel"] = table#4433 { ["type"] = "literal", ["value"] = "Decidable subspaces and recursively enumerable subspaces", ["xml:lang"] = "en", }, }, table#4434 { ["itemType"] = table#4435 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4436 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3710517", }, ["subjectLabel"] = table#4437 { ["type"] = "literal", ["value"] = "Bases of supermaximal subspaces and Steinitz systems. I", ["xml:lang"] = "en", }, }, table#4438 { ["itemType"] = table#4439 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4440 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3712329", }, ["subjectLabel"] = table#4441 { ["type"] = "literal", ["value"] = "The word problem for cancellation semigroups with zero", ["xml:lang"] = "en", }, }, table#4442 { ["itemType"] = table#4443 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4444 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3716806", }, ["subjectLabel"] = table#4445 { ["type"] = "literal", ["value"] = "The polynomial hierarchy and a simple model for competitive analysis", ["xml:lang"] = "en", }, }, table#4446 { ["itemType"] = table#4447 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4448 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3717034", }, ["subjectLabel"] = table#4449 { ["type"] = "literal", ["value"] = "Variations on promptly simple sets", ["xml:lang"] = "en", }, }, table#4450 { ["itemType"] = table#4451 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4452 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3718693", }, ["subjectLabel"] = table#4453 { ["type"] = "literal", ["value"] = "An undecidable problem in finite combinatorics", ["xml:lang"] = "en", }, }, table#4454 { ["itemType"] = table#4455 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4456 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3718696", }, ["subjectLabel"] = table#4457 { ["type"] = "literal", ["value"] = "The universal complementation property", ["xml:lang"] = "en", }, }, table#4458 { ["itemType"] = table#4459 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4460 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3981454", }, ["subjectLabel"] = table#4461 { ["type"] = "literal", ["value"] = "Embedding the diamond in the Σ₂ enumeration degrees", ["xml:lang"] = "en", }, }, table#4462 { ["itemType"] = table#4463 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4464 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3984417", }, ["subjectLabel"] = table#4465 { ["type"] = "literal", ["value"] = "On the weak Kleene scheme in Kripke's theory of truth", ["xml:lang"] = "en", }, }, table#4466 { ["itemType"] = table#4467 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4468 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3984438", }, ["subjectLabel"] = table#4469 { ["type"] = "literal", ["value"] = "Presburger arithmetic with unary predicates is Π₁¹ complete", ["xml:lang"] = "en", }, }, table#4470 { ["itemType"] = table#4471 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4472 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3984440", }, ["subjectLabel"] = table#4473 { ["type"] = "literal", ["value"] = "A universal inductive inference machine", ["xml:lang"] = "en", }, }, table#4474 { ["itemType"] = table#4475 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4476 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3984441", }, ["subjectLabel"] = table#4477 { ["type"] = "literal", ["value"] = "A construction for recursive linear orderings", ["xml:lang"] = "en", }, }, table#4478 { ["itemType"] = table#4479 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4480 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3984442", }, ["subjectLabel"] = table#4481 { ["type"] = "literal", ["value"] = "Π₀¹-classes and Rado's selection principle", ["xml:lang"] = "en", }, }, table#4482 { ["itemType"] = table#4483 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4484 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3727975", }, ["subjectLabel"] = table#4485 { ["type"] = "literal", ["value"] = "Anmerkungen zum Rekursionstheorem", ["xml:lang"] = "en", }, }, table#4486 { ["itemType"] = table#4487 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4488 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3728889", }, ["subjectLabel"] = table#4489 { ["type"] = "literal", ["value"] = "Splitting properties of r.e. sets and degrees", ["xml:lang"] = "en", }, }, table#4490 { ["itemType"] = table#4491 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4492 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3731592", }, ["subjectLabel"] = table#4493 { ["type"] = "literal", ["value"] = "Effectively nowhere simple sets", ["xml:lang"] = "en", }, }, table#4494 { ["itemType"] = table#4495 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4496 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3737421", }, ["subjectLabel"] = table#4497 { ["type"] = "literal", ["value"] = "Optimal bounds for ordinal comparison maps", ["xml:lang"] = "en", }, }, table#4498 { ["itemType"] = table#4499 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4500 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3854629", }, ["subjectLabel"] = table#4501 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3854629", }, }, table#4502 { ["itemType"] = table#4503 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4504 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3755448", }, ["subjectLabel"] = table#4505 { ["type"] = "literal", ["value"] = "Cupping and noncapping in the r.e. weak truth table and turing degrees", ["xml:lang"] = "en", }, }, table#4506 { ["itemType"] = table#4507 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4508 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3768865", }, ["subjectLabel"] = table#4509 { ["type"] = "literal", ["value"] = "Decision procedures for elementary sublanguages of set theory IX. Unsolvability of the decision problem for a restricted subclass of the Δ0-formulas in set theory", ["xml:lang"] = "en", }, }, table#4510 { ["itemType"] = table#4511 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4512 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3772179", }, ["subjectLabel"] = table#4513 { ["type"] = "literal", ["value"] = "A constructive interpretation of the full set theory", ["xml:lang"] = "en", }, }, table#4514 { ["itemType"] = table#4515 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4516 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3772192", }, ["subjectLabel"] = table#4517 { ["type"] = "literal", ["value"] = "Bounded existential induction", ["xml:lang"] = "en", }, }, table#4518 { ["itemType"] = table#4519 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4520 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3772196", }, ["subjectLabel"] = table#4521 { ["type"] = "literal", ["value"] = "Density of recursively inseparable R. E. Sets and universal recrusively inseparability", ["xml:lang"] = "en", }, }, table#4522 { ["itemType"] = table#4523 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4524 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3781088", }, ["subjectLabel"] = table#4525 { ["type"] = "literal", ["value"] = "Classifying the computational complexity of problems", ["xml:lang"] = "en", }, }, table#4526 { ["itemType"] = table#4527 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4528 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3784058", }, ["subjectLabel"] = table#4529 { ["type"] = "literal", ["value"] = "Some elementary degree-theoretic reasons why structures need similarity types", ["xml:lang"] = "en", }, }, table#4530 { ["itemType"] = table#4531 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4532 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3789542", }, ["subjectLabel"] = table#4533 { ["type"] = "literal", ["value"] = "OnP-subset structures", ["xml:lang"] = "en", }, }, table#4534 { ["itemType"] = table#4535 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4536 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3800032", }, ["subjectLabel"] = table#4537 { ["type"] = "literal", ["value"] = "The knaster-tarski fixed-point theorem is not uniformly constructive", ["xml:lang"] = "en", }, }, table#4538 { ["itemType"] = table#4539 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4540 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3803097", }, ["subjectLabel"] = table#4541 { ["type"] = "literal", ["value"] = "Embedding recursive functions in universal algorithms", ["xml:lang"] = "en", }, }, table#4542 { ["itemType"] = table#4543 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4544 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3803105", }, ["subjectLabel"] = table#4545 { ["type"] = "literal", ["value"] = "A characterization of jump operators", ["xml:lang"] = "en", }, }, table#4546 { ["itemType"] = table#4547 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4548 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3546055", }, ["subjectLabel"] = table#4549 { ["type"] = "literal", ["value"] = "Complexity of Ehrenfeucht models", ["xml:lang"] = "en", }, }, table#4550 { ["itemType"] = table#4551 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4552 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3662598", }, ["subjectLabel"] = table#4553 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3662598", }, }, table#4554 { ["itemType"] = table#4555 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4556 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3665095", }, ["subjectLabel"] = table#4557 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3665095", }, }, table#4558 { ["itemType"] = table#4559 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4560 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3824402", }, ["subjectLabel"] = table#4561 { ["type"] = "literal", ["value"] = "Finite injury and Σ₁-induction", ["xml:lang"] = "en", }, }, table#4562 { ["itemType"] = table#4563 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4564 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3570160", }, ["subjectLabel"] = table#4565 { ["type"] = "literal", ["value"] = "Schnorr trivial sets and truth-table reducibility", ["xml:lang"] = "en", }, }, table#4566 { ["itemType"] = table#4567 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4568 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3570164", }, ["subjectLabel"] = table#4569 { ["type"] = "literal", ["value"] = "Effectivity and effective continuity of multifunctions", ["xml:lang"] = "en", }, }, table#4570 { ["itemType"] = table#4571 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4572 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3576041", }, ["subjectLabel"] = table#4573 { ["type"] = "literal", ["value"] = "Program Self-reference in Constructive Scott Subdomains", ["xml:lang"] = "en", }, }, table#4574 { ["itemType"] = table#4575 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4576 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3576052", }, ["subjectLabel"] = table#4577 { ["type"] = "literal", ["value"] = "Equivalence Relations on Classes of Computable Structures", ["xml:lang"] = "en", }, }, table#4578 { ["itemType"] = table#4579 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4580 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3576054", }, ["subjectLabel"] = table#4581 { ["type"] = "literal", ["value"] = "Computable Exchangeable Sequences Have Computable de Finetti Measures", ["xml:lang"] = "en", }, }, table#4582 { ["itemType"] = table#4583 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4584 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3576064", }, ["subjectLabel"] = table#4585 { ["type"] = "literal", ["value"] = "The First Order Theories of the Medvedev and Muchnik Lattices", ["xml:lang"] = "en", }, }, table#4586 { ["itemType"] = table#4587 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4588 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3586024", }, ["subjectLabel"] = table#4589 { ["type"] = "literal", ["value"] = "On Monadic Theories of Monadic Predicates", ["xml:lang"] = "en", }, }, table#4590 { ["itemType"] = table#4591 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4592 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3853605", }, ["subjectLabel"] = table#4593 { ["type"] = "literal", ["value"] = "A complete, decidable theory with two decidable models", ["xml:lang"] = "en", }, }, table#4594 { ["itemType"] = table#4595 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4596 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3704795", }, ["subjectLabel"] = table#4597 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3704795", }, }, table#4598 { ["itemType"] = table#4599 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4600 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3861374", }, ["subjectLabel"] = table#4601 { ["type"] = "literal", ["value"] = "Recursion in a quantifier vs. elementary induction", ["xml:lang"] = "en", }, }, table#4602 { ["itemType"] = table#4603 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4604 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3864496", }, ["subjectLabel"] = table#4605 { ["type"] = "literal", ["value"] = "Σ₁-separation", ["xml:lang"] = "en", }, }, table#4606 { ["itemType"] = table#4607 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4608 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3864508", }, ["subjectLabel"] = table#4609 { ["type"] = "literal", ["value"] = "Experimental logics and Π₃⁰ theories", ["xml:lang"] = "en", }, }, table#4610 { ["itemType"] = table#4611 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4612 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3866096", }, ["subjectLabel"] = table#4613 { ["type"] = "literal", ["value"] = "Maximal and Cohesive vector spaces", ["xml:lang"] = "en", }, }, table#4614 { ["itemType"] = table#4615 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4616 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3602812", }, ["subjectLabel"] = table#4617 { ["type"] = "literal", ["value"] = "Persistent Computations of Turing Machines", ["xml:lang"] = "en", }, }, table#4618 { ["itemType"] = table#4619 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4620 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3872452", }, ["subjectLabel"] = table#4621 { ["type"] = "literal", ["value"] = "A constructive generalization of the borel-cantelli lemma with application to the complexity of infinite strings", ["xml:lang"] = "en", }, }, table#4622 { ["itemType"] = table#4623 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4624 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3880828", }, ["subjectLabel"] = table#4625 { ["type"] = "literal", ["value"] = "R-maximal Boolean algebras", ["xml:lang"] = "en", }, }, table#4626 { ["itemType"] = table#4627 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4628 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3616346", }, ["subjectLabel"] = table#4629 { ["type"] = "literal", ["value"] = "From index sets to randomness in ∅ⁿ: random reals and possibly infinite computations part II", ["xml:lang"] = "en", }, }, table#4630 { ["itemType"] = table#4631 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4632 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3616350", }, ["subjectLabel"] = table#4633 { ["type"] = "literal", ["value"] = "Reverse mathematics, computability, and partitions of trees", ["xml:lang"] = "en", }, }, table#4634 { ["itemType"] = table#4635 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4636 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3616428", }, ["subjectLabel"] = table#4637 { ["type"] = "literal", ["value"] = "A Survey of Propositional Realizability Logic", ["xml:lang"] = "en", }, }, table#4638 { ["itemType"] = table#4639 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4640 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3616433", }, ["subjectLabel"] = table#4641 { ["type"] = "literal", ["value"] = "A Natural Axiomatization of Computability and Proof of Church's Thesis", ["xml:lang"] = "en", }, }, table#4642 { ["itemType"] = table#4643 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4644 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3882438", }, ["subjectLabel"] = table#4645 { ["type"] = "literal", ["value"] = "Decidability and ℵ₀-categoricity of theories of partially ordered sets", ["xml:lang"] = "en", }, }, table#4646 { ["itemType"] = table#4647 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4648 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3618566", }, ["subjectLabel"] = table#4649 { ["type"] = "literal", ["value"] = "Hypothesis Spaces for Learning", ["xml:lang"] = "en", }, }, table#4650 { ["itemType"] = table#4651 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4652 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3625697", }, ["subjectLabel"] = table#4653 { ["type"] = "literal", ["value"] = "Highly Undecidable Problems For Infinite Computations", ["xml:lang"] = "en", }, }, table#4654 { ["itemType"] = table#4655 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4656 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3630576", }, ["subjectLabel"] = table#4657 { ["type"] = "literal", ["value"] = "Learning correction grammars", ["xml:lang"] = "en", }, }, table#4658 { ["itemType"] = table#4659 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4660 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3630588", }, ["subjectLabel"] = table#4661 { ["type"] = "literal", ["value"] = "Stability and posets", ["xml:lang"] = "en", }, }, table#4662 { ["itemType"] = table#4663 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4664 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3900052", }, ["subjectLabel"] = table#4665 { ["type"] = "literal", ["value"] = "Definability in models of set theory", ["xml:lang"] = "en", }, }, table#4666 { ["itemType"] = table#4667 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4668 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3901505", }, ["subjectLabel"] = table#4669 { ["type"] = "literal", ["value"] = "Recursively enumerable complexity sequences and measure independence", ["xml:lang"] = "en", }, }, table#4670 { ["itemType"] = table#4671 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4672 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3909040", }, ["subjectLabel"] = table#4673 { ["type"] = "literal", ["value"] = "Countable functionals and the projective hierarchy", ["xml:lang"] = "en", }, }, table#4674 { ["itemType"] = table#4675 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4676 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3644738", }, ["subjectLabel"] = table#4677 { ["type"] = "literal", ["value"] = "Kleene’s Amazing Second Recursion Theorem", ["xml:lang"] = "en", }, }, table#4678 { ["itemType"] = table#4679 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4680 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3644753", }, ["subjectLabel"] = table#4681 { ["type"] = "literal", ["value"] = "Degrees of Undecidability in Term Rewriting", ["xml:lang"] = "en", }, }, table#4682 { ["itemType"] = table#4683 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4684 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3648757", }, ["subjectLabel"] = table#4685 { ["type"] = "literal", ["value"] = "Difficulties in Forcing Fairness of Polynomial Time Inductive Inference", ["xml:lang"] = "en", }, }, table#4686 { ["itemType"] = table#4687 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4688 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3648760", }, ["subjectLabel"] = table#4689 { ["type"] = "literal", ["value"] = "Iterative Learning from Texts and Counterexamples Using Additional Information", ["xml:lang"] = "en", }, }, table#4690 { ["itemType"] = table#4691 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4692 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3648761", }, ["subjectLabel"] = table#4693 { ["type"] = "literal", ["value"] = "Incremental Learning with Ordinal Bounded Example Memory", ["xml:lang"] = "en", }, }, table#4694 { ["itemType"] = table#4695 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4696 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3648762", }, ["subjectLabel"] = table#4697 { ["type"] = "literal", ["value"] = "Learning from Streams", ["xml:lang"] = "en", }, }, table#4698 { ["itemType"] = table#4699 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4700 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3914973", }, ["subjectLabel"] = table#4701 { ["type"] = "literal", ["value"] = "Effective Galois theory", ["xml:lang"] = "en", }, }, table#4702 { ["itemType"] = table#4703 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4704 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3761351", }, ["subjectLabel"] = table#4705 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3761351", }, }, table#4706 { ["itemType"] = table#4707 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4708 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3916438", }, ["subjectLabel"] = table#4709 { ["type"] = "literal", ["value"] = "ISOMORPHISMS OF SPENCER-BROWN'S LAWS OF FORM AND VARELA'S CALCULUS FOR SELF-REFERENCE†", ["xml:lang"] = "en", }, }, table#4710 { ["itemType"] = table#4711 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4712 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3918103", }, ["subjectLabel"] = table#4713 { ["type"] = "literal", ["value"] = "A hierarchy of regular open sets of the Cantor space", ["xml:lang"] = "en", }, }, table#4714 { ["itemType"] = table#4715 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4716 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3655266", }, ["subjectLabel"] = table#4717 { ["type"] = "literal", ["value"] = "Mass Problems and Measure-Theoretic Regularity", ["xml:lang"] = "en", }, }, table#4718 { ["itemType"] = table#4719 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4720 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3922176", }, ["subjectLabel"] = table#4721 { ["type"] = "literal", ["value"] = "Stateless turing machines and fixed points", ["xml:lang"] = "en", }, }, table#4722 { ["itemType"] = table#4723 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4724 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3924184", }, ["subjectLabel"] = table#4725 { ["type"] = "literal", ["value"] = "Recursion theory on orderings. I. A model theoretic setting", ["xml:lang"] = "en", }, }, table#4726 { ["itemType"] = table#4727 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4728 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3924185", }, ["subjectLabel"] = table#4729 { ["type"] = "literal", ["value"] = "Recursion theory on orderings. II", ["xml:lang"] = "en", }, }, table#4730 { ["itemType"] = table#4731 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4732 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3924187", }, ["subjectLabel"] = table#4733 { ["type"] = "literal", ["value"] = "On r.e. and co-r.e. vector spaces with nonextendible bases", ["xml:lang"] = "en", }, }, table#4734 { ["itemType"] = table#4735 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4736 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3928239", }, ["subjectLabel"] = table#4737 { ["type"] = "literal", ["value"] = "Relative complexity of algebras", ["xml:lang"] = "en", }, }, table#4738 { ["itemType"] = table#4739 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4740 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3928245", }, ["subjectLabel"] = table#4741 { ["type"] = "literal", ["value"] = "A note on context free languages, complexity classes, and diagonalization", ["xml:lang"] = "en", }, }, table#4742 { ["itemType"] = table#4743 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4744 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3929725", }, ["subjectLabel"] = table#4745 { ["type"] = "literal", ["value"] = "Degree problems for modular machines", ["xml:lang"] = "en", }, }, table#4746 { ["itemType"] = table#4747 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4748 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3669417", }, ["subjectLabel"] = table#4749 { ["type"] = "literal", ["value"] = "On the complexity of models of arithmetic", ["xml:lang"] = "en", }, }, table#4750 { ["itemType"] = table#4751 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4752 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3671144", }, ["subjectLabel"] = table#4753 { ["type"] = "literal", ["value"] = "On homogeneity and definability in the first-order theory of the Turing degrees", ["xml:lang"] = "en", }, }, table#4754 { ["itemType"] = table#4755 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4756 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3674732", }, ["subjectLabel"] = table#4757 { ["type"] = "literal", ["value"] = "The existence of countable totally nonconstructive extensions of the countable atomless Boolean algebra", ["xml:lang"] = "en", }, }, table#4758 { ["itemType"] = table#4759 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4760 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3676135", }, ["subjectLabel"] = table#4761 { ["type"] = "literal", ["value"] = "Wtt-degrees and T-degrees of r.e. sets", ["xml:lang"] = "en", }, }, table#4762 { ["itemType"] = table#4763 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4764 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3946158", }, ["subjectLabel"] = table#4765 { ["type"] = "literal", ["value"] = "Strong noncomputability of random strings", ["xml:lang"] = "en", }, }, table#4766 { ["itemType"] = table#4767 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4768 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3947651", }, ["subjectLabel"] = table#4769 { ["type"] = "literal", ["value"] = "An invariance notion in recursion theory", ["xml:lang"] = "en", }, }, table#4770 { ["itemType"] = table#4771 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4772 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3949038", }, ["subjectLabel"] = table#4773 { ["type"] = "literal", ["value"] = "Recursion theory and the lambda-calculus", ["xml:lang"] = "en", }, }, table#4774 { ["itemType"] = table#4775 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4776 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3949046", }, ["subjectLabel"] = table#4777 { ["type"] = "literal", ["value"] = "Constructive assertions in an extension of classical mathematics", ["xml:lang"] = "en", }, }, table#4778 { ["itemType"] = table#4779 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4780 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3955337", }, ["subjectLabel"] = table#4781 { ["type"] = "literal", ["value"] = "Vaught's theorem recursively revisited", ["xml:lang"] = "en", }, }, table#4782 { ["itemType"] = table#4783 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4784 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3691651", }, ["subjectLabel"] = table#4785 { ["type"] = "literal", ["value"] = "Forcing and reductibilities. II. Forcing in fragments of analysis", ["xml:lang"] = "en", }, }, table#4786 { ["itemType"] = table#4787 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4788 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3691653", }, ["subjectLabel"] = table#4789 { ["type"] = "literal", ["value"] = "Pseudo-jump operators. II: Transfinite iterations, hierarchies and minimal covers", ["xml:lang"] = "en", }, }, table#4790 { ["itemType"] = table#4791 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4792 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3691654", }, ["subjectLabel"] = table#4793 { ["type"] = "literal", ["value"] = "Partial degrees and the density problem. Part 2: The enumeration degrees of the Σ₂ sets are dense", ["xml:lang"] = "en", }, }, table#4794 { ["itemType"] = table#4795 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4796 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3691655", }, ["subjectLabel"] = table#4797 { ["type"] = "literal", ["value"] = "A recursion theoretic analysis of the clopen Ramsey theorem", ["xml:lang"] = "en", }, }, table#4798 { ["itemType"] = table#4799 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4800 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3956932", }, ["subjectLabel"] = table#4801 { ["type"] = "literal", ["value"] = "Undecidability vs transfinite induction for the consistency of hyperarithmetical sets", ["xml:lang"] = "en", }, }, table#4802 { ["itemType"] = table#4803 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4804 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4254638", }, ["subjectLabel"] = table#4805 { ["type"] = "literal", ["value"] = "Uniform inseparability in explicit mathematics", ["xml:lang"] = "en", }, }, table#4806 { ["itemType"] = table#4807 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4808 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4132511", }, ["subjectLabel"] = table#4809 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4132511", }, }, table#4810 { ["itemType"] = table#4811 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4812 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4135468", }, ["subjectLabel"] = table#4813 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4135468", }, }, table#4814 { ["itemType"] = table#4815 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4816 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3990954", }, ["subjectLabel"] = table#4817 { ["type"] = "literal", ["value"] = "Herbrand semantics, the potential infinite, and ontology-free logic", ["xml:lang"] = "en", }, }, table#4818 { ["itemType"] = table#4819 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4820 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q3992020", }, ["subjectLabel"] = table#4821 { ["type"] = "literal", ["value"] = "Simultaneous strong separations of probabilistic and unambiguous complexity classes", ["xml:lang"] = "en", }, }, table#4822 { ["itemType"] = table#4823 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4824 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4290127", }, ["subjectLabel"] = table#4825 { ["type"] = "literal", ["value"] = "Infinitary self-reference in learning theory", ["xml:lang"] = "en", }, }, table#4826 { ["itemType"] = table#4827 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4828 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4290128", }, ["subjectLabel"] = table#4829 { ["type"] = "literal", ["value"] = "Spatial/kinematic domain and lattice computers", ["xml:lang"] = "en", }, }, table#4830 { ["itemType"] = table#4831 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4832 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4290134", }, ["subjectLabel"] = table#4833 { ["type"] = "literal", ["value"] = "Ignoring data may be the only way to learn efficiently", ["xml:lang"] = "en", }, }, table#4834 { ["itemType"] = table#4835 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4836 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4290666", }, ["subjectLabel"] = table#4837 { ["type"] = "literal", ["value"] = "Non-p-generic and strongly nonbranching degree", ["xml:lang"] = "en", }, }, table#4838 { ["itemType"] = table#4839 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4840 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4292597", }, ["subjectLabel"] = table#4841 { ["type"] = "literal", ["value"] = "On the strength of König's duality theorem for countable bipartite graphs", ["xml:lang"] = "en", }, }, table#4842 { ["itemType"] = table#4843 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4844 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4292601", }, ["subjectLabel"] = table#4845 { ["type"] = "literal", ["value"] = "The degrees of conditional problems", ["xml:lang"] = "en", }, }, table#4846 { ["itemType"] = table#4847 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4848 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4292605", }, ["subjectLabel"] = table#4849 { ["type"] = "literal", ["value"] = "A quantitative analysis of modal logic", ["xml:lang"] = "en", }, }, table#4850 { ["itemType"] = table#4851 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4852 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4155621", }, ["subjectLabel"] = table#4853 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4155621", }, }, table#4854 { ["itemType"] = table#4855 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4856 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4296631", }, ["subjectLabel"] = table#4857 { ["type"] = "literal", ["value"] = "EXTENSIONAL PROCESSING OF PROBABILITY MEASURES", ["xml:lang"] = "en", }, }, table#4858 { ["itemType"] = table#4859 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4860 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4007442", }, ["subjectLabel"] = table#4861 { ["type"] = "literal", ["value"] = "Generalized kolmogorov complexity and other dual complexity measures", ["xml:lang"] = "en", }, }, table#4862 { ["itemType"] = table#4863 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4864 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4008756", }, ["subjectLabel"] = table#4865 { ["type"] = "literal", ["value"] = "Undecidability of the identity problem for finite semigroups", ["xml:lang"] = "en", }, }, table#4866 { ["itemType"] = table#4867 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4868 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4008763", }, ["subjectLabel"] = table#4869 { ["type"] = "literal", ["value"] = "Spring Meeting of the Association for Symbolic Logic, San Francisco, 1991", ["xml:lang"] = "en", }, }, table#4870 { ["itemType"] = table#4871 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4872 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4298369", }, ["subjectLabel"] = table#4873 { ["type"] = "literal", ["value"] = "An observation on probability versus randomness with applications to complexity classes", ["xml:lang"] = "en", }, }, table#4874 { ["itemType"] = table#4875 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4876 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4301638", }, ["subjectLabel"] = table#4877 { ["type"] = "literal", ["value"] = "Statistical properties of finite sequences with high Kolmogorov complexity", ["xml:lang"] = "en", }, }, table#4878 { ["itemType"] = table#4879 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4880 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4302347", }, ["subjectLabel"] = table#4881 { ["type"] = "literal", ["value"] = "Machine learning of higher-order programs", ["xml:lang"] = "en", }, }, table#4882 { ["itemType"] = table#4883 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4884 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4304106", }, ["subjectLabel"] = table#4885 { ["type"] = "literal", ["value"] = "Recursiveness of ω‐Operations", ["xml:lang"] = "en", }, }, table#4886 { ["itemType"] = table#4887 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4888 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4304119", }, ["subjectLabel"] = table#4889 { ["type"] = "literal", ["value"] = "System function languages", ["xml:lang"] = "en", }, }, table#4890 { ["itemType"] = table#4891 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4892 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4304128", }, ["subjectLabel"] = table#4893 { ["type"] = "literal", ["value"] = "The basis decision problem in λ‐calculus", ["xml:lang"] = "en", }, }, table#4894 { ["itemType"] = table#4895 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4896 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4304156", }, ["subjectLabel"] = table#4897 { ["type"] = "literal", ["value"] = "A New Reducibility between Turing‐ and wtt‐Reducibility", ["xml:lang"] = "en", }, }, table#4898 { ["itemType"] = table#4899 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4900 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4304794", }, ["subjectLabel"] = table#4901 { ["type"] = "literal", ["value"] = "Jump Theorems for REA Operators", ["xml:lang"] = "en", }, }, table#4902 { ["itemType"] = table#4903 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4904 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4304797", }, ["subjectLabel"] = table#4905 { ["type"] = "literal", ["value"] = "A variant of the Notion of Semicreative set", ["xml:lang"] = "en", }, }, table#4906 { ["itemType"] = table#4907 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4908 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4306309", }, ["subjectLabel"] = table#4909 { ["type"] = "literal", ["value"] = "Non-p-generic and strongly nonbranching degree", ["xml:lang"] = "en", }, }, table#4910 { ["itemType"] = table#4911 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4912 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4314677", }, ["subjectLabel"] = table#4913 { ["type"] = "literal", ["value"] = "Almost weakly 2-generic sets", ["xml:lang"] = "en", }, }, table#4914 { ["itemType"] = table#4915 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4916 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4314692", }, ["subjectLabel"] = table#4917 { ["type"] = "literal", ["value"] = "Diophantine equivalence and countable rings", ["xml:lang"] = "en", }, }, table#4918 { ["itemType"] = table#4919 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4920 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4182501", }, ["subjectLabel"] = table#4921 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4182501", }, }, table#4922 { ["itemType"] = table#4923 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4924 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4032879", }, ["subjectLabel"] = table#4925 { ["type"] = "literal", ["value"] = "What is an inference rule?", ["xml:lang"] = "en", }, }, table#4926 { ["itemType"] = table#4927 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4928 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4323033", }, ["subjectLabel"] = table#4929 { ["type"] = "literal", ["value"] = "On first-order theories with provability operator", ["xml:lang"] = "en", }, }, table#4930 { ["itemType"] = table#4931 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4932 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4043074", }, ["subjectLabel"] = table#4933 { ["type"] = "literal", ["value"] = "A noninitial segment of index sets", ["xml:lang"] = "en", }, }, table#4934 { ["itemType"] = table#4935 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4936 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4047534", }, ["subjectLabel"] = table#4937 { ["type"] = "literal", ["value"] = "Periodicity in generations of automata", ["xml:lang"] = "en", }, }, table#4938 { ["itemType"] = table#4939 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4940 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4047542", }, ["subjectLabel"] = table#4941 { ["type"] = "literal", ["value"] = "Systems of notations and the ramified analytical hierarchy", ["xml:lang"] = "en", }, }, table#4942 { ["itemType"] = table#4943 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4944 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4047553", }, ["subjectLabel"] = table#4945 { ["type"] = "literal", ["value"] = "Cores of Π₁¹ sets of reals", ["xml:lang"] = "en", }, }, table#4946 { ["itemType"] = table#4947 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4948 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4049050", }, ["subjectLabel"] = table#4949 { ["type"] = "literal", ["value"] = "On subcreative sets and S-reducibility", ["xml:lang"] = "en", }, }, table#4950 { ["itemType"] = table#4951 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4952 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4052103", }, ["subjectLabel"] = table#4953 { ["type"] = "literal", ["value"] = "Degrees of unsolvability associated with Markov algorithms", ["xml:lang"] = "en", }, }, table#4954 { ["itemType"] = table#4955 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4956 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4336702", }, ["subjectLabel"] = table#4957 { ["type"] = "literal", ["value"] = "Effective Structures", ["xml:lang"] = "en", }, }, table#4958 { ["itemType"] = table#4959 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4960 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4053606", }, ["subjectLabel"] = table#4961 { ["type"] = "literal", ["value"] = "Continuity and elementary logic", ["xml:lang"] = "en", }, }, table#4962 { ["itemType"] = table#4963 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4964 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4053633", }, ["subjectLabel"] = table#4965 { ["type"] = "literal", ["value"] = "Note on the Kondo-Addison theorem", ["xml:lang"] = "en", }, }, table#4966 { ["itemType"] = table#4967 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4968 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4053638", }, ["subjectLabel"] = table#4969 { ["type"] = "literal", ["value"] = "Nonrecursive tilings of the plane. I", ["xml:lang"] = "en", }, }, table#4970 { ["itemType"] = table#4971 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4972 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4057597", }, ["subjectLabel"] = table#4973 { ["type"] = "literal", ["value"] = "Computational complexity of formal translations", ["xml:lang"] = "en", }, }, table#4974 { ["itemType"] = table#4975 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4976 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4065032", }, ["subjectLabel"] = table#4977 { ["type"] = "literal", ["value"] = "Minimal-program complexity of pseudo-recursive and pseudo-random sequences", ["xml:lang"] = "en", }, }, table#4978 { ["itemType"] = table#4979 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4980 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4065533", }, ["subjectLabel"] = table#4981 { ["type"] = "literal", ["value"] = "Σ_n sets which are Δ_n-incomparable (uniformly)", ["xml:lang"] = "en", }, }, table#4982 { ["itemType"] = table#4983 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4984 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4074891", }, ["subjectLabel"] = table#4985 { ["type"] = "literal", ["value"] = "A characterization ofR-maximal sets", ["xml:lang"] = "en", }, }, table#4986 { ["itemType"] = table#4987 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4988 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4074892", }, ["subjectLabel"] = table#4989 { ["type"] = "literal", ["value"] = "Embedding relations in the lattice of recursively enumerable sets", ["xml:lang"] = "en", }, }, table#4990 { ["itemType"] = table#4991 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4992 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4075443", }, ["subjectLabel"] = table#4993 { ["type"] = "literal", ["value"] = "The nonderivability in intuitionistic formal systems of theorems on the continuity of effective operations", ["xml:lang"] = "en", }, }, table#4994 { ["itemType"] = table#4995 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#4996 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4075448", }, ["subjectLabel"] = table#4997 { ["type"] = "literal", ["value"] = "Optimal enumerations and optimal gödel numberings", ["xml:lang"] = "en", }, }, table#4998 { ["itemType"] = table#4999 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5000 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4075451", }, ["subjectLabel"] = table#5001 { ["type"] = "literal", ["value"] = "Uniform enumeration operations", ["xml:lang"] = "en", }, }, table#5002 { ["itemType"] = table#5003 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5004 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4351919", }, ["subjectLabel"] = table#5005 { ["type"] = "literal", ["value"] = "On Nondeterminism, Enumeration Reducibility and Polynomial Bounds", ["xml:lang"] = "en", }, }, table#5006 { ["itemType"] = table#5007 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5008 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4354628", }, ["subjectLabel"] = table#5009 { ["type"] = "literal", ["value"] = "Knowledge representation as domain", ["xml:lang"] = "en", }, }, table#5010 { ["itemType"] = table#5011 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5012 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4078003", }, ["subjectLabel"] = table#5013 { ["type"] = "literal", ["value"] = "On two complete sets in the analytical and the arithmetical hierarchies", ["xml:lang"] = "en", }, }, table#5014 { ["itemType"] = table#5015 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5016 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4079599", }, ["subjectLabel"] = table#5017 { ["type"] = "literal", ["value"] = "A survey of partial degrees", ["xml:lang"] = "en", }, }, table#5018 { ["itemType"] = table#5019 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5020 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4081241", }, ["subjectLabel"] = table#5021 { ["type"] = "literal", ["value"] = "On models of arithmetic—Answers to two problems raised by H. Gaifman", ["xml:lang"] = "en", }, }, table#5022 { ["itemType"] = table#5023 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5024 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4083408", }, ["subjectLabel"] = table#5025 { ["type"] = "literal", ["value"] = "Honest bounds for complexity classes of recursive functions", ["xml:lang"] = "en", }, }, table#5026 { ["itemType"] = table#5027 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5028 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4087156", }, ["subjectLabel"] = table#5029 { ["type"] = "literal", ["value"] = "Independent Gödel sentences and independent sets", ["xml:lang"] = "en", }, }, table#5030 { ["itemType"] = table#5031 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5032 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4366134", }, ["subjectLabel"] = table#5033 { ["type"] = "literal", ["value"] = "Embeddings in the Strong Reducibilities Between 1 and npm", ["xml:lang"] = "en", }, }, table#5034 { ["itemType"] = table#5035 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5036 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4096938", }, ["subjectLabel"] = table#5037 { ["type"] = "literal", ["value"] = "Recursively presentable prime models", ["xml:lang"] = "en", }, }, table#5038 { ["itemType"] = table#5039 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5040 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4101804", }, ["subjectLabel"] = table#5041 { ["type"] = "literal", ["value"] = "On complexity properties of recursively enumerable sets", ["xml:lang"] = "en", }, }, table#5042 { ["itemType"] = table#5043 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5044 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4101808", }, ["subjectLabel"] = table#5045 { ["type"] = "literal", ["value"] = "Borel sets and hyperdegrees", ["xml:lang"] = "en", }, }, table#5046 { ["itemType"] = table#5047 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5048 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4379625", }, ["subjectLabel"] = table#5049 { ["type"] = "literal", ["value"] = "Computability of String Functions Over Algebraic Structures Armin Hemmerling", ["xml:lang"] = "en", }, }, table#5050 { ["itemType"] = table#5051 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5052 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4109657", }, ["subjectLabel"] = table#5053 { ["type"] = "literal", ["value"] = "“Helping”: several formalizations", ["xml:lang"] = "en", }, }, table#5054 { ["itemType"] = table#5055 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5056 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4382469", }, ["subjectLabel"] = table#5057 { ["type"] = "literal", ["value"] = "The structure of intrinsic complexity of learning", ["xml:lang"] = "en", }, }, table#5058 { ["itemType"] = table#5059 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5060 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4111548", }, ["subjectLabel"] = table#5061 { ["type"] = "literal", ["value"] = "Banach–Mazur games, comeager sets and degrees of unsolvability", ["xml:lang"] = "en", }, }, table#5062 { ["itemType"] = table#5063 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5064 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4115141", }, ["subjectLabel"] = table#5065 { ["type"] = "literal", ["value"] = "On degrees of unsolvability and complexity properties", ["xml:lang"] = "en", }, }, table#5066 { ["itemType"] = table#5067 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5068 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4119190", }, ["subjectLabel"] = table#5069 { ["type"] = "literal", ["value"] = "Descending sequences of degrees", ["xml:lang"] = "en", }, }, table#5070 { ["itemType"] = table#5071 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5072 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4121398", }, ["subjectLabel"] = table#5073 { ["type"] = "literal", ["value"] = "On the complexity of finite, pushdown, and stack automata", ["xml:lang"] = "en", }, }, table#5074 { ["itemType"] = table#5075 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5076 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4128807", }, ["subjectLabel"] = table#5077 { ["type"] = "literal", ["value"] = "Δ 2 0 -Mengen", ["xml:lang"] = "en", }, }, table#5078 { ["itemType"] = table#5079 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5080 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4130955", }, ["subjectLabel"] = table#5081 { ["type"] = "literal", ["value"] = "Syntax and semantics of universal programming languages", ["xml:lang"] = "en", }, }, table#5082 { ["itemType"] = table#5083 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5084 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4133125", }, ["subjectLabel"] = table#5085 { ["type"] = "literal", ["value"] = "Total complexity and the inference of best programs", ["xml:lang"] = "en", }, }, table#5086 { ["itemType"] = table#5087 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5088 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4143285", }, ["subjectLabel"] = table#5089 { ["type"] = "literal", ["value"] = "A note on the number of zeros of polynomials and exponential polynomials", ["xml:lang"] = "en", }, }, table#5090 { ["itemType"] = table#5091 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5092 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4161312", }, ["subjectLabel"] = table#5093 { ["type"] = "literal", ["value"] = "Transfinite extensions of Friedberg's completeness criterion", ["xml:lang"] = "en", }, }, table#5094 { ["itemType"] = table#5095 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5096 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4162665", }, ["subjectLabel"] = table#5097 { ["type"] = "literal", ["value"] = "INPUT/OUTPUT CODINGS AND TRANSITION FUNCTIONS IN EFFECTIVE SYSTEMS", ["xml:lang"] = "en", }, }, table#5098 { ["itemType"] = table#5099 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5100 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4163200", }, ["subjectLabel"] = table#5101 { ["type"] = "literal", ["value"] = "On generalized computational complexity", ["xml:lang"] = "en", }, }, table#5102 { ["itemType"] = table#5103 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5104 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4170231", }, ["subjectLabel"] = table#5105 { ["type"] = "literal", ["value"] = "Polynomial enumeration of multidimensional lattices", ["xml:lang"] = "en", }, }, table#5106 { ["itemType"] = table#5107 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5108 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4170709", }, ["subjectLabel"] = table#5109 { ["type"] = "literal", ["value"] = "Uniform upper bounds on ideals of turing degrees", ["xml:lang"] = "en", }, }, table#5110 { ["itemType"] = table#5111 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5112 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4300060", }, ["subjectLabel"] = table#5113 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4300060", }, }, table#5114 { ["itemType"] = table#5115 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5116 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4180331", }, ["subjectLabel"] = table#5117 { ["type"] = "literal", ["value"] = "Compact and ϖ-compact formulas in 51-151-151-1", ["xml:lang"] = "en", }, }, table#5118 { ["itemType"] = table#5119 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5120 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4182492", }, ["subjectLabel"] = table#5121 { ["type"] = "literal", ["value"] = "Controlling the dependence degree of a recursively enumerable vector space", ["xml:lang"] = "en", }, }, table#5122 { ["itemType"] = table#5123 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5124 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4182725", }, ["subjectLabel"] = table#5125 { ["type"] = "literal", ["value"] = "Some results on measure independent Gödel speed-ups", ["xml:lang"] = "en", }, }, table#5126 { ["itemType"] = table#5127 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5128 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4182728", }, ["subjectLabel"] = table#5129 { ["type"] = "literal", ["value"] = "Nowhere simple sets and the lattice of recursively enumerable sets", ["xml:lang"] = "en", }, }, table#5130 { ["itemType"] = table#5131 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5132 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4182737", }, ["subjectLabel"] = table#5133 { ["type"] = "literal", ["value"] = "Analytic determinacy and 0^#", ["xml:lang"] = "en", }, }, table#5134 { ["itemType"] = table#5135 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5136 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4184828", }, ["subjectLabel"] = table#5137 { ["type"] = "literal", ["value"] = "The perfect set theorem and definable wellorderings of the continuum", ["xml:lang"] = "en", }, }, table#5138 { ["itemType"] = table#5139 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5140 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4185801", }, ["subjectLabel"] = table#5141 { ["type"] = "literal", ["value"] = "Computational complexity, speedable and levelable sets", ["xml:lang"] = "en", }, }, table#5142 { ["itemType"] = table#5143 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5144 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4186305", }, ["subjectLabel"] = table#5145 { ["type"] = "literal", ["value"] = "Sets which do not have subsets of every higher degree", ["xml:lang"] = "en", }, }, table#5146 { ["itemType"] = table#5147 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5148 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4191606", }, ["subjectLabel"] = table#5149 { ["type"] = "literal", ["value"] = "On “provable” analogs of and", ["xml:lang"] = "en", }, }, table#5150 { ["itemType"] = table#5151 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5152 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4192056", }, ["subjectLabel"] = table#5153 { ["type"] = "literal", ["value"] = "Consistency proof without transfinite induction for a formal system for turing machines", ["xml:lang"] = "en", }, }, table#5154 { ["itemType"] = table#5155 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5156 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4194931", }, ["subjectLabel"] = table#5157 { ["type"] = "literal", ["value"] = "Degrees of sensible lambda theories", ["xml:lang"] = "en", }, }, table#5158 { ["itemType"] = table#5159 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5160 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4198741", }, ["subjectLabel"] = table#5161 { ["type"] = "literal", ["value"] = "Double jumps of minimal degrees", ["xml:lang"] = "en", }, }, table#5162 { ["itemType"] = table#5163 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5164 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4327093", }, ["subjectLabel"] = table#5165 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4327093", }, }, table#5166 { ["itemType"] = table#5167 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5168 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4207893", }, ["subjectLabel"] = table#5169 { ["type"] = "literal", ["value"] = "On the ranked points of a Π₁⁰ set", ["xml:lang"] = "en", }, }, table#5170 { ["itemType"] = table#5171 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5172 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4210834", }, ["subjectLabel"] = table#5173 { ["type"] = "literal", ["value"] = "Derivatives of Computable Functions", ["xml:lang"] = "en", }, }, table#5174 { ["itemType"] = table#5175 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5176 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4212918", }, ["subjectLabel"] = table#5177 { ["type"] = "literal", ["value"] = "Explicit mathematics with the monotone fixed point principle", ["xml:lang"] = "en", }, }, table#5178 { ["itemType"] = table#5179 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5180 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4057637", }, ["subjectLabel"] = table#5181 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4057637", }, }, table#5182 { ["itemType"] = table#5183 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5184 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4063428", }, ["subjectLabel"] = table#5185 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4063428", }, }, table#5186 { ["itemType"] = table#5187 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5188 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4224077", }, ["subjectLabel"] = table#5189 { ["type"] = "literal", ["value"] = "Some Special Pairs of Σ2 e-Degrees", ["xml:lang"] = "en", }, }, table#5190 { ["itemType"] = table#5191 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5192 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4227855", }, ["subjectLabel"] = table#5193 { ["type"] = "literal", ["value"] = "Incompleteness, Mechanism, and Optimism", ["xml:lang"] = "en", }, }, table#5194 { ["itemType"] = table#5195 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5196 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4227856", }, ["subjectLabel"] = table#5197 { ["type"] = "literal", ["value"] = "Truth Definitions, Skolem Functions and Axiomatic Set Theory", ["xml:lang"] = "en", }, }, table#5198 { ["itemType"] = table#5199 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5200 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4238424", }, ["subjectLabel"] = table#5201 { ["type"] = "literal", ["value"] = "Towards the Actual Relationship Between NP and Exponential Time", ["xml:lang"] = "en", }, }, table#5202 { ["itemType"] = table#5203 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5204 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4784342", }, ["subjectLabel"] = table#5205 { ["type"] = "literal", ["value"] = "On an open problem in classification of languages", ["xml:lang"] = "en", }, }, table#5206 { ["itemType"] = table#5207 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5208 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4630267", }, ["subjectLabel"] = table#5209 { ["type"] = "literal", ["value"] = "Computational depth and reducibility", ["xml:lang"] = "en", }, }, table#5210 { ["itemType"] = table#5211 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5212 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4532601", }, ["subjectLabel"] = table#5213 { ["type"] = "literal", ["value"] = "Embedding finite lattices into the Σ₂⁰ enumeration degrees", ["xml:lang"] = "en", }, }, table#5214 { ["itemType"] = table#5215 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5216 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5048927", }, ["subjectLabel"] = table#5217 { ["type"] = "literal", ["value"] = "On the classification of computable languages", ["xml:lang"] = "en", }, }, table#5218 { ["itemType"] = table#5219 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5220 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5048952", }, ["subjectLabel"] = table#5221 { ["type"] = "literal", ["value"] = "Equivalence of measures of complexity classes", ["xml:lang"] = "en", }, }, table#5222 { ["itemType"] = table#5223 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5224 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5055946", }, ["subjectLabel"] = table#5225 { ["type"] = "literal", ["value"] = "Cellular automata universality revisited", ["xml:lang"] = "en", }, }, table#5226 { ["itemType"] = table#5227 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5228 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5055957", }, ["subjectLabel"] = table#5229 { ["type"] = "literal", ["value"] = "The complexity of universal text-learners", ["xml:lang"] = "en", }, }, table#5230 { ["itemType"] = table#5231 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5232 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5057467", }, ["subjectLabel"] = table#5233 { ["type"] = "literal", ["value"] = "Effective applicative structures", ["xml:lang"] = "en", }, }, table#5234 { ["itemType"] = table#5235 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5236 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4630268", }, ["subjectLabel"] = table#5237 { ["type"] = "literal", ["value"] = "Learnability: Admissible, co-finite, and hypersimple languages", ["xml:lang"] = "en", }, }, table#5238 { ["itemType"] = table#5239 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5240 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5059700", }, ["subjectLabel"] = table#5241 { ["type"] = "literal", ["value"] = "Undecidability of QLTL and QCTL with two variables and one monadic predicate letter", ["xml:lang"] = "en", }, }, table#5242 { ["itemType"] = table#5243 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5244 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4809631", }, ["subjectLabel"] = table#5245 { ["type"] = "literal", ["value"] = "Boolean reducibility", ["xml:lang"] = "en", }, }, table#5246 { ["itemType"] = table#5247 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5248 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5061393", }, ["subjectLabel"] = table#5249 { ["type"] = "literal", ["value"] = "Non-collapse of the effective Wadge hierarchy", ["xml:lang"] = "en", }, }, table#5250 { ["itemType"] = table#5251 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5252 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5070470", }, ["subjectLabel"] = table#5253 { ["type"] = "literal", ["value"] = "HTP-COMPLETE RINGS OF RATIONAL NUMBERS", ["xml:lang"] = "en", }, }, table#5254 { ["itemType"] = table#5255 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5256 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4645195", }, ["subjectLabel"] = table#5257 { ["type"] = "literal", ["value"] = "Weakly useful sequences", ["xml:lang"] = "en", }, }, table#5258 { ["itemType"] = table#5259 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5260 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4560352", }, ["subjectLabel"] = table#5261 { ["type"] = "literal", ["value"] = "Inductive inference of recursive functions: Qualitative theory", ["xml:lang"] = "en", }, }, table#5262 { ["itemType"] = table#5263 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5264 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4560353", }, ["subjectLabel"] = table#5265 { ["type"] = "literal", ["value"] = "Inductive inference of recursive functions: Complexity bounds", ["xml:lang"] = "en", }, }, table#5266 { ["itemType"] = table#5267 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5268 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5074105", }, ["subjectLabel"] = table#5269 { ["type"] = "literal", ["value"] = "A Medida de Informação de Shannon: Entropia", ["xml:lang"] = "en", }, }, table#5270 { ["itemType"] = table#5271 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5272 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4565755", }, ["subjectLabel"] = table#5273 { ["type"] = "literal", ["value"] = "Torsion-free abelian groups with optimal Scott families", ["xml:lang"] = "en", }, }, table#5274 { ["itemType"] = table#5275 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5276 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4565825", }, ["subjectLabel"] = table#5277 { ["type"] = "literal", ["value"] = "Vagueness and Formal Fuzzy Logic: Some Criticisms", ["xml:lang"] = "en", }, }, table#5278 { ["itemType"] = table#5279 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5280 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4571947", }, ["subjectLabel"] = table#5281 { ["type"] = "literal", ["value"] = "Some bounds on the computational power of piecewise constant derivative systems (extended abstract)", ["xml:lang"] = "en", }, }, table#5282 { ["itemType"] = table#5283 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5284 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4835848", }, ["subjectLabel"] = table#5285 { ["type"] = "literal", ["value"] = "Generalization versus classification", ["xml:lang"] = "en", }, }, table#5286 { ["itemType"] = table#5287 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5288 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4835867", }, ["subjectLabel"] = table#5289 { ["type"] = "literal", ["value"] = "Prudence in vacillatory language identification", ["xml:lang"] = "en", }, }, table#5290 { ["itemType"] = table#5291 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5292 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4836053", }, ["subjectLabel"] = table#5293 { ["type"] = "literal", ["value"] = "Requirement systems", ["xml:lang"] = "en", }, }, table#5294 { ["itemType"] = table#5295 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5296 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4836056", }, ["subjectLabel"] = table#5297 { ["type"] = "literal", ["value"] = "Fine hierarchies and Boolean terms", ["xml:lang"] = "en", }, }, table#5298 { ["itemType"] = table#5299 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5300 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4577997", }, ["subjectLabel"] = table#5301 { ["type"] = "literal", ["value"] = "STRICT FINITISM, FEASIBILITY, AND THE SORITES", ["xml:lang"] = "en", }, }, table#5302 { ["itemType"] = table#5303 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5304 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4580034", }, ["subjectLabel"] = table#5305 { ["type"] = "literal", ["value"] = "PERMUTATIONS OF THE INTEGERS INDUCE ONLY THE TRIVIAL AUTOMORPHISM OF THE TURING DEGREES", ["xml:lang"] = "en", }, }, table#5306 { ["itemType"] = table#5307 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5308 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4844508", }, ["subjectLabel"] = table#5309 { ["type"] = "literal", ["value"] = "Feasible Graphs and Colorings", ["xml:lang"] = "en", }, }, table#5310 { ["itemType"] = table#5311 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5312 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4844514", }, ["subjectLabel"] = table#5313 { ["type"] = "literal", ["value"] = "Some New Lattice Constructions in High R. E. Degrees", ["xml:lang"] = "en", }, }, table#5314 { ["itemType"] = table#5315 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5316 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5096158", }, ["subjectLabel"] = table#5317 { ["type"] = "literal", ["value"] = "Complete problems and strong polynomial reducibilities", ["xml:lang"] = "en", }, }, table#5318 { ["itemType"] = table#5319 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5320 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5096241", }, ["subjectLabel"] = table#5321 { ["type"] = "literal", ["value"] = "Efficient program synthesis: Semantics, logic, complexity", ["xml:lang"] = "en", }, }, table#5322 { ["itemType"] = table#5323 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5324 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5096341", }, ["subjectLabel"] = table#5325 { ["type"] = "literal", ["value"] = "Unbounded search and recursive graph problems", ["xml:lang"] = "en", }, }, table#5326 { ["itemType"] = table#5327 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5328 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5096845", }, ["subjectLabel"] = table#5329 { ["type"] = "literal", ["value"] = "Small universal one-state linear operator algorithm", ["xml:lang"] = "en", }, }, table#5330 { ["itemType"] = table#5331 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5332 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5100056", }, ["subjectLabel"] = table#5333 { ["type"] = "literal", ["value"] = "COPYING ONE OF A PAIR OF STRUCTURES", ["xml:lang"] = "en", }, }, table#5334 { ["itemType"] = table#5335 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5336 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5100062", }, ["subjectLabel"] = table#5337 { ["type"] = "literal", ["value"] = "INITIAL SEGMENTS OF THE DEGREES OF CEERS", ["xml:lang"] = "en", }, }, table#5338 { ["itemType"] = table#5339 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5340 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4993800", }, ["subjectLabel"] = table#5341 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4993800", }, }, table#5342 { ["itemType"] = table#5343 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5344 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4993802", }, ["subjectLabel"] = table#5345 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4993802", }, }, table#5346 { ["itemType"] = table#5347 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5348 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4993819", }, ["subjectLabel"] = table#5349 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4993819", }, }, table#5350 { ["itemType"] = table#5351 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5352 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4994212", }, ["subjectLabel"] = table#5353 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4994212", }, }, table#5354 { ["itemType"] = table#5355 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5356 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4593240", }, ["subjectLabel"] = table#5357 { ["type"] = "literal", ["value"] = "Computable elements and functions in effectively enumerable topological spaces", ["xml:lang"] = "en", }, }, table#5358 { ["itemType"] = table#5359 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5360 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4593244", }, ["subjectLabel"] = table#5361 { ["type"] = "literal", ["value"] = "Quantifying over events in probability logic: an introduction", ["xml:lang"] = "en", }, }, table#5362 { ["itemType"] = table#5363 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5364 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4593245", }, ["subjectLabel"] = table#5365 { ["type"] = "literal", ["value"] = "Some results related to the continuity problem", ["xml:lang"] = "en", }, }, table#5366 { ["itemType"] = table#5367 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5368 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4858804", }, ["subjectLabel"] = table#5369 { ["type"] = "literal", ["value"] = "How to Compute Antiderivatives", ["xml:lang"] = "en", }, }, table#5370 { ["itemType"] = table#5371 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5372 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4868245", }, ["subjectLabel"] = table#5373 { ["type"] = "literal", ["value"] = "Intrinsically II Relations", ["xml:lang"] = "en", }, }, table#5374 { ["itemType"] = table#5375 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5376 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4868246", }, ["subjectLabel"] = table#5377 { ["type"] = "literal", ["value"] = "A Note on Closed Degrees of Difficulty of the Medvedev Lattice", ["xml:lang"] = "en", }, }, table#5378 { ["itemType"] = table#5379 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5380 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4606776", }, ["subjectLabel"] = table#5381 { ["type"] = "literal", ["value"] = "The Gödelian Foundations of Self-Reference,the Liar and Incompleteness: Arms Racein Complex Strategic Innovation", ["xml:lang"] = "en", }, }, table#5382 { ["itemType"] = table#5383 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5384 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5013820", }, ["subjectLabel"] = table#5385 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5013820", }, }, table#5386 { ["itemType"] = table#5387 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5388 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5015280", }, ["subjectLabel"] = table#5389 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5015280", }, }, table#5390 { ["itemType"] = table#5391 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5392 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5020646", }, ["subjectLabel"] = table#5393 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5020646", }, }, table#5394 { ["itemType"] = table#5395 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5396 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4879203", }, ["subjectLabel"] = table#5397 { ["type"] = "literal", ["value"] = "Effectively and Noneffectively Nowhere Simple Sets", ["xml:lang"] = "en", }, }, table#5398 { ["itemType"] = table#5399 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5400 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4879211", }, ["subjectLabel"] = table#5401 { ["type"] = "literal", ["value"] = "An enlarged family of packing polynomials on multidimensional lattices", ["xml:lang"] = "en", }, }, table#5402 { ["itemType"] = table#5403 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5404 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4879912", }, ["subjectLabel"] = table#5405 { ["type"] = "literal", ["value"] = "Asymptotic conditional probabilities: The non-unary case", ["xml:lang"] = "en", }, }, table#5406 { ["itemType"] = table#5407 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5408 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4769049", }, ["subjectLabel"] = table#5409 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4769049", }, }, table#5410 { ["itemType"] = table#5411 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5412 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4630303", }, ["subjectLabel"] = table#5413 { ["type"] = "literal", ["value"] = "What is a universal higher-order programming language?", ["xml:lang"] = "en", }, }, table#5414 { ["itemType"] = table#5415 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5416 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4895816", }, ["subjectLabel"] = table#5417 { ["type"] = "literal", ["value"] = "NP-Creative sets: A new class of creative sets in NP", ["xml:lang"] = "en", }, }, table#5418 { ["itemType"] = table#5419 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5420 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4895818", }, ["subjectLabel"] = table#5421 { ["type"] = "literal", ["value"] = "Strong self-reducibility precludes strong immunity", ["xml:lang"] = "en", }, }, table#5422 { ["itemType"] = table#5423 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5424 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4637218", }, ["subjectLabel"] = table#5425 { ["type"] = "literal", ["value"] = "Theses for Computation and Recursion on Concrete and Abstract Structures", ["xml:lang"] = "en", }, }, table#5426 { ["itemType"] = table#5427 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5428 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4637226", }, ["subjectLabel"] = table#5429 { ["type"] = "literal", ["value"] = "Why Turing’s Thesis Is Not a Thesis", ["xml:lang"] = "en", }, }, table#5430 { ["itemType"] = table#5431 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5432 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4638982", }, ["subjectLabel"] = table#5433 { ["type"] = "literal", ["value"] = "ZFC PROVES THAT THE CLASS OF ORDINALS IS NOT WEAKLY COMPACT FOR DEFINABLE CLASSES", ["xml:lang"] = "en", }, }, table#5434 { ["itemType"] = table#5435 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5436 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4382500", }, ["subjectLabel"] = table#5437 { ["type"] = "literal", ["value"] = "Domains for Computation in Mathematics, Physics and Exact Real Arithmetic", ["xml:lang"] = "en", }, }, table#5438 { ["itemType"] = table#5439 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5440 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4530147", }, ["subjectLabel"] = table#5441 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4530147", }, }, table#5442 { ["itemType"] = table#5443 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5444 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4916185", }, ["subjectLabel"] = table#5445 { ["type"] = "literal", ["value"] = "Recursive Quantum Functions, Avoidable Points, & Shadow Points in Recursive Analysis", ["xml:lang"] = "en", }, }, table#5446 { ["itemType"] = table#5447 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5448 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4918009", }, ["subjectLabel"] = table#5449 { ["type"] = "literal", ["value"] = "Towards Computability over Effectively Enumerable Topological Spaces", ["xml:lang"] = "en", }, }, table#5450 { ["itemType"] = table#5451 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5452 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4918020", }, ["subjectLabel"] = table#5453 { ["type"] = "literal", ["value"] = "On the Difference Hierarchy in Countably Based T0-Spaces", ["xml:lang"] = "en", }, }, table#5454 { ["itemType"] = table#5455 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5456 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4391431", }, ["subjectLabel"] = table#5457 { ["type"] = "literal", ["value"] = "On effective topological spaces", ["xml:lang"] = "en", }, }, table#5458 { ["itemType"] = table#5459 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5460 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4921445", }, ["subjectLabel"] = table#5461 { ["type"] = "literal", ["value"] = "Revising Type-2 Computation and Degrees of Discontinuity", ["xml:lang"] = "en", }, }, table#5462 { ["itemType"] = table#5463 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5464 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5055887", }, ["subjectLabel"] = table#5465 { ["type"] = "literal", ["value"] = "Effective category and measure in abstract complexity theory", ["xml:lang"] = "en", }, }, table#5466 { ["itemType"] = table#5467 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5468 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4928973", }, ["subjectLabel"] = table#5469 { ["type"] = "literal", ["value"] = "On the bounded quasi‐degrees of c.e. sets", ["xml:lang"] = "en", }, }, table#5470 { ["itemType"] = table#5471 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5472 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4401430", }, ["subjectLabel"] = table#5473 { ["type"] = "literal", ["value"] = "Recursive elements and constructive extensions of computable local integral domains", ["xml:lang"] = "en", }, }, table#5474 { ["itemType"] = table#5475 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5476 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4404867", }, ["subjectLabel"] = table#5477 { ["type"] = "literal", ["value"] = "Post's problem and his hypersimple set", ["xml:lang"] = "en", }, }, table#5478 { ["itemType"] = table#5479 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5480 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4404868", }, ["subjectLabel"] = table#5481 { ["type"] = "literal", ["value"] = "Encodability of Kleene's O", ["xml:lang"] = "en", }, }, table#5482 { ["itemType"] = table#5483 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5484 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4678932", }, ["subjectLabel"] = table#5485 { ["type"] = "literal", ["value"] = "Barwise: Infinitary Logic and Admissible Sets", ["xml:lang"] = "en", }, }, table#5486 { ["itemType"] = table#5487 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5488 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5094901", }, ["subjectLabel"] = table#5489 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5094901", }, }, table#5490 { ["itemType"] = table#5491 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5492 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4953205", }, ["subjectLabel"] = table#5493 { ["type"] = "literal", ["value"] = "The complexity of ODD_n^A", ["xml:lang"] = "en", }, }, table#5494 { ["itemType"] = table#5495 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5496 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4953207", }, ["subjectLabel"] = table#5497 { ["type"] = "literal", ["value"] = "The distribution of properly Σ₂⁰ e-degrees", ["xml:lang"] = "en", }, }, table#5498 { ["itemType"] = table#5499 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5500 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4432544", }, ["subjectLabel"] = table#5501 { ["type"] = "literal", ["value"] = "2002 European Summer Meeting of the Association for Symbolic Logic Logic Colloquium '02", ["xml:lang"] = "en", }, }, table#5502 { ["itemType"] = table#5503 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5504 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4451721", }, ["subjectLabel"] = table#5505 { ["type"] = "literal", ["value"] = "Regular enumerations", ["xml:lang"] = "en", }, }, table#5506 { ["itemType"] = table#5507 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5508 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4717048", }, ["subjectLabel"] = table#5509 { ["type"] = "literal", ["value"] = "On the robustness of ALMOST-$\\mathcal {R}$", ["xml:lang"] = "en", }, }, table#5510 { ["itemType"] = table#5511 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5512 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4457733", }, ["subjectLabel"] = table#5513 { ["type"] = "literal", ["value"] = "Some strongly undecidable natural arithmetical problems, with an application to intuitionistic theories", ["xml:lang"] = "en", }, }, table#5514 { ["itemType"] = table#5515 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5516 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4460756", }, ["subjectLabel"] = table#5517 { ["type"] = "literal", ["value"] = "DEFINABILITY OF THE JUMP OPERATOR IN THE ENUMERATION DEGREES", ["xml:lang"] = "en", }, }, table#5518 { ["itemType"] = table#5519 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5520 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4462679", }, ["subjectLabel"] = table#5521 { ["type"] = "literal", ["value"] = "Wadge Degrees ofω-Languages of Deterministic Turing Machines", ["xml:lang"] = "en", }, }, table#5522 { ["itemType"] = table#5523 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5524 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4723719", }, ["subjectLabel"] = table#5525 { ["type"] = "literal", ["value"] = "On minimal pairs of enumeration degrees", ["xml:lang"] = "en", }, }, table#5526 { ["itemType"] = table#5527 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5528 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4982989", }, ["subjectLabel"] = table#5529 { ["type"] = "literal", ["value"] = "Logical Theory of the Additive Monoid of Subsets of Natural Integers", ["xml:lang"] = "en", }, }, table#5530 { ["itemType"] = table#5531 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5532 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4984865", }, ["subjectLabel"] = table#5533 { ["type"] = "literal", ["value"] = "COMPUTABILITY IN PARTIAL COMBINATORY ALGEBRAS", ["xml:lang"] = "en", }, }, table#5534 { ["itemType"] = table#5535 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5536 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4467341", }, ["subjectLabel"] = table#5537 { ["type"] = "literal", ["value"] = "Nonlinear phenomena in spaces of algorithms", ["xml:lang"] = "en", }, }, table#5538 { ["itemType"] = table#5539 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5540 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4727430", }, ["subjectLabel"] = table#5541 { ["type"] = "literal", ["value"] = "Complete sets and closeness to complexity classes", ["xml:lang"] = "en", }, }, table#5542 { ["itemType"] = table#5543 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5544 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4728280", }, ["subjectLabel"] = table#5545 { ["type"] = "literal", ["value"] = "Une critique de la notion de test de processus fondée sur la non séparabilité de certaines classes de langages", ["xml:lang"] = "en", }, }, table#5546 { ["itemType"] = table#5547 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5548 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4729388", }, ["subjectLabel"] = table#5549 { ["type"] = "literal", ["value"] = "Characterizations of semantic domains for randomized algorithms", ["xml:lang"] = "en", }, }, table#5550 { ["itemType"] = table#5551 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5552 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4735186", }, ["subjectLabel"] = table#5553 { ["type"] = "literal", ["value"] = "A cardinality version of Beigel's nonspeedup theorem", ["xml:lang"] = "en", }, }, table#5554 { ["itemType"] = table#5555 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5556 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5000272", }, ["subjectLabel"] = table#5557 { ["type"] = "literal", ["value"] = "THE OPEN AND CLOPEN RAMSEY THEOREMS IN THE WEIHRAUCH LATTICE", ["xml:lang"] = "en", }, }, table#5558 { ["itemType"] = table#5559 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5560 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4749831", }, ["subjectLabel"] = table#5561 { ["type"] = "literal", ["value"] = "Partial degrees and the density problem", ["xml:lang"] = "en", }, }, table#5562 { ["itemType"] = table#5563 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5564 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4750634", }, ["subjectLabel"] = table#5565 { ["type"] = "literal", ["value"] = "Degrees of Structures", ["xml:lang"] = "en", }, }, table#5566 { ["itemType"] = table#5567 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5568 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5011342", }, ["subjectLabel"] = table#5569 { ["type"] = "literal", ["value"] = "Introduction to the Zambelli Festschrift", ["xml:lang"] = "en", }, }, table#5570 { ["itemType"] = table#5571 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5572 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4921447", }, ["subjectLabel"] = table#5573 { ["type"] = "literal", ["value"] = "Enumerations of Π10 Classes: Acceptability and Decidable Classes", ["xml:lang"] = "en", }, }, table#5574 { ["itemType"] = table#5575 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5576 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4764617", }, ["subjectLabel"] = table#5577 { ["type"] = "literal", ["value"] = "Theoretical Pearls:Representing ‘undefined’ in lambda calculus", ["xml:lang"] = "en", }, }, table#5578 { ["itemType"] = table#5579 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5580 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4770392", }, ["subjectLabel"] = table#5581 { ["type"] = "literal", ["value"] = "On centain decompositions of Gödel numberings", ["xml:lang"] = "en", }, }, table#5582 { ["itemType"] = table#5583 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5584 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5024504", }, ["subjectLabel"] = table#5585 { ["type"] = "literal", ["value"] = "HIERARCHICAL INCOMPLETENESS RESULTS FOR ARITHMETICALLY DEFINABLE EXTENSIONS OF FRAGMENTS OF ARITHMETIC", ["xml:lang"] = "en", }, }, table#5586 { ["itemType"] = table#5587 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5588 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4773694", }, ["subjectLabel"] = table#5589 { ["type"] = "literal", ["value"] = "Decidability of the “almost all” theory of degrees", ["xml:lang"] = "en", }, }, table#5590 { ["itemType"] = table#5591 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5592 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4773695", }, ["subjectLabel"] = table#5593 { ["type"] = "literal", ["value"] = "Index sets in Ershov's hierarchy", ["xml:lang"] = "en", }, }, table#5594 { ["itemType"] = table#5595 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5596 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q4774029", }, ["subjectLabel"] = table#5597 { ["type"] = "literal", ["value"] = "Mitotic recursively enumerable sets", ["xml:lang"] = "en", }, }, table#5598 { ["itemType"] = table#5599 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5600 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5027663", }, ["subjectLabel"] = table#5601 { ["type"] = "literal", ["value"] = "EFFECTIVE INSEPARABILITY, LATTICES, AND PREORDERING RELATIONS", ["xml:lang"] = "en", }, }, table#5602 { ["itemType"] = table#5603 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5604 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5549803", }, ["subjectLabel"] = table#5605 { ["type"] = "literal", ["value"] = "Uniformly introreducible sets", ["xml:lang"] = "en", }, }, table#5606 { ["itemType"] = table#5607 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5608 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5283431", }, ["subjectLabel"] = table#5609 { ["type"] = "literal", ["value"] = "Parallel Feedback Turing Computability", ["xml:lang"] = "en", }, }, table#5610 { ["itemType"] = table#5611 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5612 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5571700", }, ["subjectLabel"] = table#5613 { ["type"] = "literal", ["value"] = "The degrees of hyperhyperimmune sets", ["xml:lang"] = "en", }, }, table#5614 { ["itemType"] = table#5615 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5616 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5573379", }, ["subjectLabel"] = table#5617 { ["type"] = "literal", ["value"] = "Sets with no subset of higher degree", ["xml:lang"] = "en", }, }, table#5618 { ["itemType"] = table#5619 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5620 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5573381", }, ["subjectLabel"] = table#5621 { ["type"] = "literal", ["value"] = "Constructive order types on cuts", ["xml:lang"] = "en", }, }, table#5622 { ["itemType"] = table#5623 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5624 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5581617", }, ["subjectLabel"] = table#5625 { ["type"] = "literal", ["value"] = "A note on degrees of subsets¹", ["xml:lang"] = "en", }, }, table#5626 { ["itemType"] = table#5627 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5628 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5581622", }, ["subjectLabel"] = table#5629 { ["type"] = "literal", ["value"] = "Eine Bemerkung zum Begriff der zuf�lligen Folge", ["xml:lang"] = "en", }, }, table#5630 { ["itemType"] = table#5631 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5632 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5585407", }, ["subjectLabel"] = table#5633 { ["type"] = "literal", ["value"] = "Effectively retractable theories and degrees of undecidability", ["xml:lang"] = "en", }, }, table#5634 { ["itemType"] = table#5635 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5636 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5588634", }, ["subjectLabel"] = table#5637 { ["type"] = "literal", ["value"] = "Index sets of finite classes of recursively enumerable sets", ["xml:lang"] = "en", }, }, table#5638 { ["itemType"] = table#5639 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5640 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5590058", }, ["subjectLabel"] = table#5641 { ["type"] = "literal", ["value"] = "On primitive recursive permutations and their inverses", ["xml:lang"] = "en", }, }, table#5642 { ["itemType"] = table#5643 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5644 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5307612", }, ["subjectLabel"] = table#5645 { ["type"] = "literal", ["value"] = "Almost everywhere domination and superhighness", ["xml:lang"] = "en", }, }, table#5646 { ["itemType"] = table#5647 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5648 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5307613", }, ["subjectLabel"] = table#5649 { ["type"] = "literal", ["value"] = "Mass problems and almost everywhere domination", ["xml:lang"] = "en", }, }, table#5650 { ["itemType"] = table#5651 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5652 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5311714", }, ["subjectLabel"] = table#5653 { ["type"] = "literal", ["value"] = "Splittings of effectively speedable sets and effectively levelable sets", ["xml:lang"] = "en", }, }, table#5654 { ["itemType"] = table#5655 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5656 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5311725", }, ["subjectLabel"] = table#5657 { ["type"] = "literal", ["value"] = "Parsimony hierarchies for inductive inference", ["xml:lang"] = "en", }, }, table#5658 { ["itemType"] = table#5659 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5660 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5311741", }, ["subjectLabel"] = table#5661 { ["type"] = "literal", ["value"] = "Degrees of unsolvability of continuous functions", ["xml:lang"] = "en", }, }, table#5662 { ["itemType"] = table#5663 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5664 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5311742", }, ["subjectLabel"] = table#5665 { ["type"] = "literal", ["value"] = "Π₁¹ relations and paths through", ["xml:lang"] = "en", }, }, table#5666 { ["itemType"] = table#5667 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5668 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5311749", }, ["subjectLabel"] = table#5669 { ["type"] = "literal", ["value"] = "Every polynomial-time 1-degree collapses if and only if P = PSPACE", ["xml:lang"] = "en", }, }, table#5670 { ["itemType"] = table#5671 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5672 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5313376", }, ["subjectLabel"] = table#5673 { ["type"] = "literal", ["value"] = "Arithmetical independence results using higher recursion theory", ["xml:lang"] = "en", }, }, table#5674 { ["itemType"] = table#5675 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5676 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5605217", }, ["subjectLabel"] = table#5677 { ["type"] = "literal", ["value"] = "A note on the hyperarithmetical hierarchy", ["xml:lang"] = "en", }, }, table#5678 { ["itemType"] = table#5679 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5680 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5609381", }, ["subjectLabel"] = table#5681 { ["type"] = "literal", ["value"] = "Definability in the monadic second-order theory of successor", ["xml:lang"] = "en", }, }, table#5682 { ["itemType"] = table#5683 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5684 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5623225", }, ["subjectLabel"] = table#5685 { ["type"] = "literal", ["value"] = "Speed-Ups by changing the order in which sets are enumerated", ["xml:lang"] = "en", }, }, table#5686 { ["itemType"] = table#5687 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5688 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5626634", }, ["subjectLabel"] = table#5689 { ["type"] = "literal", ["value"] = "On analytic well-orderings", ["xml:lang"] = "en", }, }, table#5690 { ["itemType"] = table#5691 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5692 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5626636", }, ["subjectLabel"] = table#5693 { ["type"] = "literal", ["value"] = "Hierarchies of Boolean algebras", ["xml:lang"] = "en", }, }, table#5694 { ["itemType"] = table#5695 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5696 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5631092", }, ["subjectLabel"] = table#5697 { ["type"] = "literal", ["value"] = "Some contrasts between degrees and the arithmetical hierarchy", ["xml:lang"] = "en", }, }, table#5698 { ["itemType"] = table#5699 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5700 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5633985", }, ["subjectLabel"] = table#5701 { ["type"] = "literal", ["value"] = "Recursively enumerable sets which are uniform for finite extensions", ["xml:lang"] = "en", }, }, table#5702 { ["itemType"] = table#5703 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5704 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5637881", }, ["subjectLabel"] = table#5705 { ["type"] = "literal", ["value"] = "Subrecursiveness: Machine-independent notions of computability in restricted time and storage", ["xml:lang"] = "en", }, }, table#5706 { ["itemType"] = table#5707 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5708 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5101444", }, ["subjectLabel"] = table#5709 { ["type"] = "literal", ["value"] = "Game characterizations of logic program properties", ["xml:lang"] = "en", }, }, table#5710 { ["itemType"] = table#5711 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5712 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5107218", }, ["subjectLabel"] = table#5713 { ["type"] = "literal", ["value"] = "ON ISOMORPHISM CLASSES OF COMPUTABLY ENUMERABLE EQUIVALENCE RELATIONS", ["xml:lang"] = "en", }, }, table#5714 { ["itemType"] = table#5715 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5716 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5659529", }, ["subjectLabel"] = table#5717 { ["type"] = "literal", ["value"] = "Minimum models of analysis", ["xml:lang"] = "en", }, }, table#5718 { ["itemType"] = table#5719 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5720 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5113922", }, ["subjectLabel"] = table#5721 { ["type"] = "literal", ["value"] = "Minimal Weak Truth Table Degrees and Computably Enumerable Turing Degrees", ["xml:lang"] = "en", }, }, table#5722 { ["itemType"] = table#5723 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5724 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5663367", }, ["subjectLabel"] = table#5725 { ["type"] = "literal", ["value"] = "Computational speed-up by effective operators", ["xml:lang"] = "en", }, }, table#5726 { ["itemType"] = table#5727 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5728 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5663844", }, ["subjectLabel"] = table#5729 { ["type"] = "literal", ["value"] = "Decision problems for tag systems", ["xml:lang"] = "en", }, }, table#5730 { ["itemType"] = table#5731 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5732 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5663847", }, ["subjectLabel"] = table#5733 { ["type"] = "literal", ["value"] = "The strong homogeneity conjecture", ["xml:lang"] = "en", }, }, table#5734 { ["itemType"] = table#5735 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5736 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5117593", }, ["subjectLabel"] = table#5737 { ["type"] = "literal", ["value"] = "INCOMPLETENESS VIA PARADOX AND COMPLETENESS", ["xml:lang"] = "en", }, }, table#5738 { ["itemType"] = table#5739 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5740 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5119677", }, ["subjectLabel"] = table#5741 { ["type"] = "literal", ["value"] = "Roots and (Re)sources of Value (In)definiteness Versus Contextuality", ["xml:lang"] = "en", }, }, table#5742 { ["itemType"] = table#5743 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5744 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5670615", }, ["subjectLabel"] = table#5745 { ["type"] = "literal", ["value"] = "A discrete chain of degrees of index sets", ["xml:lang"] = "en", }, }, table#5746 { ["itemType"] = table#5747 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5748 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5369029", }, ["subjectLabel"] = table#5749 { ["type"] = "literal", ["value"] = "As easy as $\\mathbb {Q}$: Hilbert’s Tenth Problem for subrings of the rationals and number fields", ["xml:lang"] = "en", }, }, table#5750 { ["itemType"] = table#5751 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5752 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5677475", }, ["subjectLabel"] = table#5753 { ["type"] = "literal", ["value"] = "Ramsey's theorem and recursion theory", ["xml:lang"] = "en", }, }, table#5754 { ["itemType"] = table#5755 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5756 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5687408", }, ["subjectLabel"] = table#5757 { ["type"] = "literal", ["value"] = "Recursion in Partial Type‐1 Objects With Well‐Behaved Oracles", ["xml:lang"] = "en", }, }, table#5758 { ["itemType"] = table#5759 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5760 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5687409", }, ["subjectLabel"] = table#5761 { ["type"] = "literal", ["value"] = "Recursive Structures and Ershov's Hierarchy", ["xml:lang"] = "en", }, }, table#5762 { ["itemType"] = table#5763 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5764 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5687410", }, ["subjectLabel"] = table#5765 { ["type"] = "literal", ["value"] = "Intrinsically Hyperarithmetical Sets", ["xml:lang"] = "en", }, }, table#5766 { ["itemType"] = table#5767 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5768 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5381038", }, ["subjectLabel"] = table#5769 { ["type"] = "literal", ["value"] = "A UNIFIED THEORY OF TRUTH AND PARADOX", ["xml:lang"] = "en", }, }, table#5770 { ["itemType"] = table#5771 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5772 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5387300", }, ["subjectLabel"] = table#5773 { ["type"] = "literal", ["value"] = "2007 European Summer Meeting of the Association for Symbolic Logic: Logic Colloquium '07", ["xml:lang"] = "en", }, }, table#5774 { ["itemType"] = table#5775 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5776 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5138493", }, ["subjectLabel"] = table#5777 { ["type"] = "literal", ["value"] = "Appraising two decades of distributed computing theory research", ["xml:lang"] = "en", }, }, table#5778 { ["itemType"] = table#5779 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5780 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5388722", }, ["subjectLabel"] = table#5781 { ["type"] = "literal", ["value"] = "Isomorphism relations on computable structures", ["xml:lang"] = "en", }, }, table#5782 { ["itemType"] = table#5783 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5784 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5396227", }, ["subjectLabel"] = table#5785 { ["type"] = "literal", ["value"] = "When series of computable functions with varying domains are computable", ["xml:lang"] = "en", }, }, table#5786 { ["itemType"] = table#5787 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5788 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5704378", }, ["subjectLabel"] = table#5789 { ["type"] = "literal", ["value"] = "A CHARACTERIZATION OF THE ARITHMETICAL HIERARCHY BY LANGUAGE EQUATIONS", ["xml:lang"] = "en", }, }, table#5790 { ["itemType"] = table#5791 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5792 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5718694", }, ["subjectLabel"] = table#5793 { ["type"] = "literal", ["value"] = "Random reals and possibly infinite computations Part I: Randomness in ∅′", ["xml:lang"] = "en", }, }, table#5794 { ["itemType"] = table#5795 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5796 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5164866", }, ["subjectLabel"] = table#5797 { ["type"] = "literal", ["value"] = "Self-Verifying Pushdown and Queue Automata", ["xml:lang"] = "en", }, }, table#5798 { ["itemType"] = table#5799 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5800 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5925970", }, ["subjectLabel"] = table#5801 { ["type"] = "literal", ["value"] = "Weakly computable real numbers", ["xml:lang"] = "en", }, }, table#5802 { ["itemType"] = table#5803 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5804 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5737944", }, ["subjectLabel"] = table#5805 { ["type"] = "literal", ["value"] = "TRIAL AND ERROR MATHEMATICS II: DIALECTICAL SETS AND QUASIDIALECTICAL SETS, THEIR DEGREES, AND THEIR DISTRIBUTION WITHIN THE CLASS OF LIMIT SETS", ["xml:lang"] = "en", }, }, table#5806 { ["itemType"] = table#5807 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5808 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5738208", }, ["subjectLabel"] = table#5809 { ["type"] = "literal", ["value"] = "MARGINALIA ON A THEOREM OF WOODIN", ["xml:lang"] = "en", }, }, table#5810 { ["itemType"] = table#5811 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5812 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5934287", }, ["subjectLabel"] = table#5813 { ["type"] = "literal", ["value"] = "Semantics of constructions. I: The traditional approach", ["xml:lang"] = "en", }, }, table#5814 { ["itemType"] = table#5815 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5816 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5422318", }, ["subjectLabel"] = table#5817 { ["type"] = "literal", ["value"] = "The settling-time reducibility ordering", ["xml:lang"] = "en", }, }, table#5818 { ["itemType"] = table#5819 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5820 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5740667", }, ["subjectLabel"] = table#5821 { ["type"] = "literal", ["value"] = "Wadge hardness in Scott spaces and its effectivization", ["xml:lang"] = "en", }, }, table#5822 { ["itemType"] = table#5823 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5824 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5919177", }, ["subjectLabel"] = table#5825 { ["type"] = "literal", ["value"] = "Friedberg numberings in the Ershov hierarchy", ["xml:lang"] = "en", }, }, table#5826 { ["itemType"] = table#5827 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5828 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5741335", }, ["subjectLabel"] = table#5829 { ["type"] = "literal", ["value"] = "Index Sets of Constructive Models that are Autostable Under Strong Constructivizations", ["xml:lang"] = "en", }, }, table#5830 { ["itemType"] = table#5831 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5832 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5741354", }, ["subjectLabel"] = table#5833 { ["type"] = "literal", ["value"] = "Sums of Computable Ordinals", ["xml:lang"] = "en", }, }, table#5834 { ["itemType"] = table#5835 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5836 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5741358", }, ["subjectLabel"] = table#5837 { ["type"] = "literal", ["value"] = "Perfect Local Computability of Superatomic Boolean Algebras", ["xml:lang"] = "en", }, }, table#5838 { ["itemType"] = table#5839 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5840 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5741445", }, ["subjectLabel"] = table#5841 { ["type"] = "literal", ["value"] = "Defining totality in the enumeration degrees", ["xml:lang"] = "en", }, }, table#5842 { ["itemType"] = table#5843 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5844 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5741615", }, ["subjectLabel"] = table#5845 { ["type"] = "literal", ["value"] = "TRIAL AND ERROR MATHEMATICS I: DIALECTICAL AND QUASIDIALECTICAL SYSTEMS", ["xml:lang"] = "en", }, }, table#5846 { ["itemType"] = table#5847 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5848 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5906326", }, ["subjectLabel"] = table#5849 { ["type"] = "literal", ["value"] = "Achilles and the tortoise climbing up the arithmetical hierarchy", ["xml:lang"] = "en", }, }, table#5850 { ["itemType"] = table#5851 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5852 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5941287", }, ["subjectLabel"] = table#5853 { ["type"] = "literal", ["value"] = "Robust learning with infinite additional information", ["xml:lang"] = "en", }, }, table#5854 { ["itemType"] = table#5855 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5856 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5941288", }, ["subjectLabel"] = table#5857 { ["type"] = "literal", ["value"] = "Costs of general purpose learning", ["xml:lang"] = "en", }, }, table#5858 { ["itemType"] = table#5859 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5860 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5941366", }, ["subjectLabel"] = table#5861 { ["type"] = "literal", ["value"] = "On the learnability of recursively enumerable languages from good examples", ["xml:lang"] = "en", }, }, table#5862 { ["itemType"] = table#5863 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5864 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5941566", }, ["subjectLabel"] = table#5865 { ["type"] = "literal", ["value"] = "Probabilistic inductive inference: A survey", ["xml:lang"] = "en", }, }, table#5866 { ["itemType"] = table#5867 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5868 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5942014", }, ["subjectLabel"] = table#5869 { ["type"] = "literal", ["value"] = "Complexity properties of recursively enumerable sets and \$bsQ\$-completeness", ["xml:lang"] = "en", }, }, table#5870 { ["itemType"] = table#5871 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5872 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5943125", }, ["subjectLabel"] = table#5873 { ["type"] = "literal", ["value"] = "Robust learning is rich", ["xml:lang"] = "en", }, }, table#5874 { ["itemType"] = table#5875 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5876 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5183473", }, ["subjectLabel"] = table#5877 { ["type"] = "literal", ["value"] = "The relation of A to Prov ˹A˺ in the Lindenbaum sentence algebra", ["xml:lang"] = "en", }, }, table#5878 { ["itemType"] = table#5879 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5880 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5946255", }, ["subjectLabel"] = table#5881 { ["type"] = "literal", ["value"] = "Cooperation and computability in \$n\$-player games", ["xml:lang"] = "en", }, }, table#5882 { ["itemType"] = table#5883 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5884 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5752560", }, ["subjectLabel"] = table#5885 { ["type"] = "literal", ["value"] = "Maximal r.e. equivalence relations", ["xml:lang"] = "en", }, }, table#5886 { ["itemType"] = table#5887 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5888 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5753942", }, ["subjectLabel"] = table#5889 { ["type"] = "literal", ["value"] = "Effective model theory vs. recursive model theory", ["xml:lang"] = "en", }, }, table#5890 { ["itemType"] = table#5891 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5892 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5753943", }, ["subjectLabel"] = table#5893 { ["type"] = "literal", ["value"] = "The Complexity of intrinsically r.e. subsets of existentially decidable models", ["xml:lang"] = "en", }, }, table#5894 { ["itemType"] = table#5895 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5896 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5957916", }, ["subjectLabel"] = table#5897 { ["type"] = "literal", ["value"] = "Arithmetic complexity of the predicate logics of certain complete arithmetic theories", ["xml:lang"] = "en", }, }, table#5898 { ["itemType"] = table#5899 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5900 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5958122", }, ["subjectLabel"] = table#5901 { ["type"] = "literal", ["value"] = "Hyper-polynomial hierarchies and the polynomial jump", ["xml:lang"] = "en", }, }, table#5902 { ["itemType"] = table#5903 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5904 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5958133", }, ["subjectLabel"] = table#5905 { ["type"] = "literal", ["value"] = "Representations versus numberings: On the relationship of two computability notions", ["xml:lang"] = "en", }, }, table#5906 { ["itemType"] = table#5907 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5908 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5958309", }, ["subjectLabel"] = table#5909 { ["type"] = "literal", ["value"] = "Control structures in hypothesis spaces: The influence on learning", ["xml:lang"] = "en", }, }, table#5910 { ["itemType"] = table#5911 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5912 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5958649", }, ["subjectLabel"] = table#5913 { ["type"] = "literal", ["value"] = "Predictive learning models for concept drift", ["xml:lang"] = "en", }, }, table#5914 { ["itemType"] = table#5915 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5916 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5958651", }, ["subjectLabel"] = table#5917 { ["type"] = "literal", ["value"] = "Closedness properties in ex-identification", ["xml:lang"] = "en", }, }, table#5918 { ["itemType"] = table#5919 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5920 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5202181", }, ["subjectLabel"] = table#5921 { ["type"] = "literal", ["value"] = "Undecidability and initial segments of the (r.e.) tt-degrees", ["xml:lang"] = "en", }, }, table#5922 { ["itemType"] = table#5923 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5924 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5101343", }, ["subjectLabel"] = table#5925 { ["type"] = "literal", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5101343", }, }, table#5926 { ["itemType"] = table#5927 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5928 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5452183", }, ["subjectLabel"] = table#5929 { ["type"] = "literal", ["value"] = "Artin’s Conjecture and Size of Finite Probabilistic Automata", ["xml:lang"] = "en", }, }, table#5930 { ["itemType"] = table#5931 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5932 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5458068", }, ["subjectLabel"] = table#5933 { ["type"] = "literal", ["value"] = "Computability and information in models of randomness and chaos", ["xml:lang"] = "en", }, }, table#5934 { ["itemType"] = table#5935 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5936 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5462115", }, ["subjectLabel"] = table#5937 { ["type"] = "literal", ["value"] = "UNSOLVABILITY LEVELS OF OPERATION PROBLEMS FOR SUBCLASSES OF CONTEXT-FREE LANGUAGES", ["xml:lang"] = "en", }, }, table#5938 { ["itemType"] = table#5939 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5940 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5213636", }, ["subjectLabel"] = table#5941 { ["type"] = "literal", ["value"] = "Naturalness in Mathematics", ["xml:lang"] = "en", }, }, table#5942 { ["itemType"] = table#5943 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5944 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5213766", }, ["subjectLabel"] = table#5945 { ["type"] = "literal", ["value"] = "Paraconsistent Computation and Dialetheic Machines", ["xml:lang"] = "en", }, }, table#5946 { ["itemType"] = table#5947 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5948 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5220248", }, ["subjectLabel"] = table#5949 { ["type"] = "literal", ["value"] = "Vladimir Andreevich Uspensky (27/11/1930–27/6/2018)", ["xml:lang"] = "en", }, }, table#5950 { ["itemType"] = table#5951 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5952 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5477636", }, ["subjectLabel"] = table#5953 { ["type"] = "literal", ["value"] = "Computable trees of Scott rank ω₁^CK, and computable approximation", ["xml:lang"] = "en", }, }, table#5954 { ["itemType"] = table#5955 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5956 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5485491", }, ["subjectLabel"] = table#5957 { ["type"] = "literal", ["value"] = "Kolmogorov complexity and set theoretical representations of integers", ["xml:lang"] = "en", }, }, table#5958 { ["itemType"] = table#5959 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5960 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5491241", }, ["subjectLabel"] = table#5961 { ["type"] = "literal", ["value"] = "On the structure of partially ordered sets of Boolean degrees", ["xml:lang"] = "en", }, }, table#5962 { ["itemType"] = table#5963 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5964 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5501864", }, ["subjectLabel"] = table#5965 { ["type"] = "literal", ["value"] = "Linear grammars with one-sided contexts and their automaton representation", ["xml:lang"] = "en", }, }, table#5966 { ["itemType"] = table#5967 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5968 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5247021", }, ["subjectLabel"] = table#5969 { ["type"] = "literal", ["value"] = "Definability via Kalimullin pairs in the structure of the enumeration degrees", ["xml:lang"] = "en", }, }, table#5970 { ["itemType"] = table#5971 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5972 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5502826", }, ["subjectLabel"] = table#5973 { ["type"] = "literal", ["value"] = "A characterization of the δ₂⁰ hyperhyperimmune sets", ["xml:lang"] = "en", }, }, table#5974 { ["itemType"] = table#5975 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5976 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5250212", }, ["subjectLabel"] = table#5977 { ["type"] = "literal", ["value"] = "Constructive Recursive Functions, Church’s Thesis, and Brouwer’s Theory of the Creating Subject: Afterthoughts on a Parisian Joint Session", ["xml:lang"] = "en", }, }, table#5978 { ["itemType"] = table#5979 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5980 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5250213", }, ["subjectLabel"] = table#5981 { ["type"] = "literal", ["value"] = "The Developments of the Concept of Machine Computability from 1936 to the 1960s", ["xml:lang"] = "en", }, }, table#5982 { ["itemType"] = table#5983 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5984 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5251233", }, ["subjectLabel"] = table#5985 { ["type"] = "literal", ["value"] = "The complexity of proving chaoticity and the Church–Turing thesis", ["xml:lang"] = "en", }, }, table#5986 { ["itemType"] = table#5987 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5988 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5259722", }, ["subjectLabel"] = table#5989 { ["type"] = "literal", ["value"] = "AXIOMATIZING SEMANTIC THEORIES OF TRUTH?", ["xml:lang"] = "en", }, }, table#5990 { ["itemType"] = table#5991 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5992 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5864724", }, ["subjectLabel"] = table#5993 { ["type"] = "literal", ["value"] = "Freezing, Bounded-Change and Convergent Cellular Automata", ["xml:lang"] = "en", }, }, table#5994 { ["itemType"] = table#5995 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#5996 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5274881", }, ["subjectLabel"] = table#5997 { ["type"] = "literal", ["value"] = "EQUIVALENCES FOR TRUTH PREDICATES", ["xml:lang"] = "en", }, }, table#5998 { ["itemType"] = table#5999 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6000 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5878916", }, ["subjectLabel"] = table#6001 { ["type"] = "literal", ["value"] = "Effective longest and infinite reduction paths in untyped λ-calculi", ["xml:lang"] = "en", }, }, table#6002 { ["itemType"] = table#6003 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6004 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6047663", }, ["subjectLabel"] = table#6005 { ["type"] = "literal", ["value"] = "Agreement reducibility", ["xml:lang"] = "en", }, }, table#6006 { ["itemType"] = table#6007 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6008 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6047676", }, ["subjectLabel"] = table#6009 { ["type"] = "literal", ["value"] = "r‐Maximal sets and Q1,N‐reducibility", ["xml:lang"] = "en", }, }, table#6010 { ["itemType"] = table#6011 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6012 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6061900", }, ["subjectLabel"] = table#6013 { ["type"] = "literal", ["value"] = "Reflecting and self-confident inductive inference machines", ["xml:lang"] = "en", }, }, table#6014 { ["itemType"] = table#6015 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6016 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6061902", }, ["subjectLabel"] = table#6017 { ["type"] = "literal", ["value"] = "Application of kolmogorov complexity to inductive inference with limited memory", ["xml:lang"] = "en", }, }, table#6018 { ["itemType"] = table#6019 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6020 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6064290", }, ["subjectLabel"] = table#6021 { ["type"] = "literal", ["value"] = "Automatic presentations of structures", ["xml:lang"] = "en", }, }, table#6022 { ["itemType"] = table#6023 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6024 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6075540", }, ["subjectLabel"] = table#6025 { ["type"] = "literal", ["value"] = "Бинарный предикат, транзитивное замыкание, две-три переменные: сыграем в домино?", ["xml:lang"] = "en", }, }, table#6026 { ["itemType"] = table#6027 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6028 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6082366", }, ["subjectLabel"] = table#6029 { ["type"] = "literal", ["value"] = "The Higman operations and embeddings of recursive groups", ["xml:lang"] = "en", }, }, table#6030 { ["itemType"] = table#6031 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6032 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6083908", }, ["subjectLabel"] = table#6033 { ["type"] = "literal", ["value"] = "Machine induction without revolutionary paradigm shifts", ["xml:lang"] = "en", }, }, table#6034 { ["itemType"] = table#6035 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6036 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6088491", }, ["subjectLabel"] = table#6037 { ["type"] = "literal", ["value"] = "The dependence of computability on numerical notations", ["xml:lang"] = "en", }, }, table#6038 { ["itemType"] = table#6039 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6040 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6090449", }, ["subjectLabel"] = table#6041 { ["type"] = "literal", ["value"] = "A complete characterization of infinitely repeated two-player games having computable strategies with no computable best response under limit-of-means payoff", ["xml:lang"] = "en", }, }, table#6042 { ["itemType"] = table#6043 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6044 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6094127", }, ["subjectLabel"] = table#6045 { ["type"] = "literal", ["value"] = "Normalizing notations in the Ershov hierarchy", ["xml:lang"] = "en", }, }, table#6046 { ["itemType"] = table#6047 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6048 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6095979", }, ["subjectLabel"] = table#6049 { ["type"] = "literal", ["value"] = "THE DISCONTINUITY PROBLEM", ["xml:lang"] = "en", }, }, table#6050 { ["itemType"] = table#6051 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6052 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6132637", }, ["subjectLabel"] = table#6053 { ["type"] = "literal", ["value"] = "Nonuniformity of downward density in \$n\$-computably enumerable Turing degrees", ["xml:lang"] = "en", }, }, table#6054 { ["itemType"] = table#6055 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6056 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6132642", }, ["subjectLabel"] = table#6057 { ["type"] = "literal", ["value"] = "Reducibility by means of almost polynomial functions", ["xml:lang"] = "en", }, }, table#6058 { ["itemType"] = table#6059 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6060 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6135832", }, ["subjectLabel"] = table#6061 { ["type"] = "literal", ["value"] = "Generic algebraic properties in spaces of enumerated groups", ["xml:lang"] = "en", }, }, table#6062 { ["itemType"] = table#6063 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6064 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6137192", }, ["subjectLabel"] = table#6065 { ["type"] = "literal", ["value"] = "Cold dynamics in cellular automata: a tutorial", ["xml:lang"] = "en", }, }, table#6066 { ["itemType"] = table#6067 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6068 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6137845", }, ["subjectLabel"] = table#6069 { ["type"] = "literal", ["value"] = "Constructive Many-one Reduction from the Halting Problem to Semi-unification (Extended Version)", ["xml:lang"] = "en", }, }, table#6070 { ["itemType"] = table#6071 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6072 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6140757", }, ["subjectLabel"] = table#6073 { ["type"] = "literal", ["value"] = "A classification of low c.e. sets and the Ershov hierarchy", ["xml:lang"] = "en", }, }, table#6074 { ["itemType"] = table#6075 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6076 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6145398", }, ["subjectLabel"] = table#6077 { ["type"] = "literal", ["value"] = "On proofs of properties of semirecursive sets", ["xml:lang"] = "en", }, }, table#6078 { ["itemType"] = table#6079 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6080 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6146825", }, ["subjectLabel"] = table#6081 { ["type"] = "literal", ["value"] = "How much partiality is needed for a theory of computability?", ["xml:lang"] = "en", }, }, table#6082 { ["itemType"] = table#6083 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6084 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6151610", }, ["subjectLabel"] = table#6085 { ["type"] = "literal", ["value"] = "Certifying expressive power and algorithms of reversible primitive permutations with \\textsf{Lean}", ["xml:lang"] = "en", }, }, table#6086 { ["itemType"] = table#6087 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6088 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6171780", }, ["subjectLabel"] = table#6089 { ["type"] = "literal", ["value"] = "Liminf progress measures", ["xml:lang"] = "en", }, }, table#6090 { ["itemType"] = table#6091 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6092 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6175224", }, ["subjectLabel"] = table#6093 { ["type"] = "literal", ["value"] = "Lower semilattices of separable congruences of numbered algebras", ["xml:lang"] = "en", }, }, table#6094 { ["itemType"] = table#6095 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6096 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6175230", }, ["subjectLabel"] = table#6097 { ["type"] = "literal", ["value"] = "Embedding of the first nonconstructive ordinal into the Rogers semilattices of families of arithmetic sets", ["xml:lang"] = "en", }, }, table#6098 { ["itemType"] = table#6099 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6100 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6183616", }, ["subjectLabel"] = table#6101 { ["type"] = "literal", ["value"] = "Event detection for ODES and nonrecursive hierarchies", ["xml:lang"] = "en", }, }, table#6102 { ["itemType"] = table#6103 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6104 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6185608", }, ["subjectLabel"] = table#6105 { ["type"] = "literal", ["value"] = "Arithmetical hierarchy of the Besicovitch-stability of noisy tilings", ["xml:lang"] = "en", }, }, table#6106 { ["itemType"] = table#6107 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6108 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6190409", }, ["subjectLabel"] = table#6109 { ["type"] = "literal", ["value"] = "Game semantics of Martin-Löf type theory", ["xml:lang"] = "en", }, }, table#6110 { ["itemType"] = table#6111 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6112 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q6186308", }, ["subjectLabel"] = table#6113 { ["type"] = "literal", ["value"] = "Learnability and positive equivalence relations", ["xml:lang"] = "en", }, }, table#6114 { ["itemType"] = table#6115 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6116 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5958756", }, ["subjectLabel"] = table#6117 { ["type"] = "literal", ["value"] = "On the asymptotic behaviour of primitive recursive algorithms", ["xml:lang"] = "en", }, }, table#6118 { ["itemType"] = table#6119 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6120 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5961497", }, ["subjectLabel"] = table#6121 { ["type"] = "literal", ["value"] = "Cupping and noncupping in the enumeration degrees of \$\\Sigma_ 2^ 0\$ sets", ["xml:lang"] = "en", }, }, table#6122 { ["itemType"] = table#6123 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6124 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5964016", }, ["subjectLabel"] = table#6125 { ["type"] = "literal", ["value"] = "Least and greatest solutions of equations over sets of integers", ["xml:lang"] = "en", }, }, table#6126 { ["itemType"] = table#6127 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6128 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5965131", }, ["subjectLabel"] = table#6129 { ["type"] = "literal", ["value"] = "Ash's theorem on \$\\Delta_{\\alpha}^{0}\$-categorical structures and a condition for infinite \$\\Delta_{\\alpha}^{0}\$-dimension", ["xml:lang"] = "en", }, }, table#6130 { ["itemType"] = table#6131 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6132 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5970839", }, ["subjectLabel"] = table#6133 { ["type"] = "literal", ["value"] = "Sublinear-time reductions for big data computing", ["xml:lang"] = "en", }, }, [0] = table#6134 { ["itemType"] = table#6135 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q5976449", }, ["subject"] = table#6136 { ["type"] = "uri", ["value"] = "https://portal.mardi4nfdi.de/entity/Q818514", }, ["subjectLabel"] = table#6137 { ["type"] = "literal", ["value"] = "The Medvedev lattice of computably closed sets", ["xml:lang"] = "en", }, }, }, }, } table#1 { ["head"] = table#2 { ["vars"] = table#3 { "propertyLabel", "value", "valueLabel", [0] = "property", }, }, ["results"] = table#4 { ["bindings"] = table#5 { }, }, } table#1 { ["head"] = table#2 { ["vars"] = table#3 { "propertyLabel", "value", "valueLabel", [0] = "property", }, }, ["results"] = table#4 { ["bindings"] = table#5 { }, }, }

scientific article; zbMATH DE number 3291134