Search results for 'Recursive programming' (try it on Scholar)

1000+ found
Sort by:
  1. Enric Casaban Moya (1972). Recursive Techniques in Programming, de DW Barron. Teorema: Revista Internacional de Filosofía 2 (5):136-138.score: 120.0
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
  2. J. S. Moore, R. S. Boyer & R. E. Shostak, Primitive Recursive Program Transformation.score: 70.0
    arbitrary flowchart programs by introducing a new recursive function for each tag point. In the above example, one obtains: int(x) = int1(x,0), p(n,¤| ,... .ur. ¢.vH(¤.¤,.~¤,) ..... 1 h(n.c¤| ..... ¤r)), w(n.y2l(n.¤l ,.... ul,) ...., y2r(n,a|,_,,¤l_))_..
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
  3. Peter Lauer (1979). Review: W. P. De Roever, Recursive Program Schemes: Semantics and Proof Theory. [REVIEW] Journal of Symbolic Logic 44 (4):658-659.score: 60.0
    No categories
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  4. J. W. Klop (1980). Combinatory Reduction Systems. Mathematisch Centrum.score: 60.0
    No categories
     
    My bibliography  
     
    Export citation  
  5. A. L. Rastsvetaev (1989). On Monadic Logic of Recursive Programs with Parameters. Bulletin of the Section of Logic 18 (2):57-61.score: 60.0
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
  6. Lou van den Dries & Yiannis N. Moschovakis (2004). The Euclidean Algorithm on the Natural Numbers Æ= 0, 1,... Can Be Specified Succinctly by the Recursive Program. Bulletin of Symbolic Logic 10 (3).score: 60.0
    Direct download  
     
    My bibliography  
     
    Export citation  
  7. Pauli Brattico (2010). Recursion Hypothesis Considered as a Research Program for Cognitive Science. Minds and Machines 20 (2):213-241.score: 52.0
    Humans grasp discrete infinities within several cognitive domains, such as in language, thought, social cognition and tool-making. It is sometimes suggested that any such generative ability is based on a computational system processing hierarchical and recursive mental representations. One view concerning such generativity has been that each of the mind’s modules defining a cognitive domain implements its own recursive computational system. In this paper recent evidence to the contrary is reviewed and it is proposed that there is only (...)
    Direct download (10 more)  
     
    My bibliography  
     
    Export citation  
  8. Hilbert Levitz, Warren Nichols & Robert F. Smith (1991). A Macro Program for the Primitive Recursive Functions. Mathematical Logic Quarterly 37 (8):121-124.score: 50.0
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  9. W. Marek, A. Nerode & J. Remmel (1992). How Complicated is the Set of Stable Models of a Recursive Logic Program? Annals of Pure and Applied Logic 56 (1-3):119-135.score: 50.0
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  10. Stefano Mazzanti (1997). Iterative Characterizations of Computable Unary Functions: A General Method. Mathematical Logic Quarterly 43 (1):29-38.score: 48.0
    No categories
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  11. Bruno Buchberger (1972). A Study on Universal Functions. Institut für Numerische Mathematik Und Elektronische Informationsverarbeitung, Universität Innsbruck.score: 48.0
    No categories
     
    My bibliography  
     
    Export citation  
  12. Klaus Ambos-Spies & André Nies (1992). Cappable Recursively Enumerable Degrees and Post's Program. Archive for Mathematical Logic 32 (1):51-56.score: 42.0
    We give a simple structural property which characterizes the r.e. sets whose (Turing) degrees are cappable. Since cappable degrees are incomplete, this may be viewed as a solution of Post's program, which asks for a simple structural property of nonrecursive r.e. sets which ensures incompleteness.
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  13. Alexander Kreuzer & Ulrich Kohlenbach (2009). Ramsey's Theorem for Pairs and Provably Recursive Functions. Notre Dame Journal of Formal Logic 50 (4):427-444.score: 40.0
    This paper addresses the strength of Ramsey's theorem for pairs ($RT^2_2$) over a weak base theory from the perspective of 'proof mining'. Let $RT^{2-}_2$ denote Ramsey's theorem for pairs where the coloring is given by an explicit term involving only numeric variables. We add this principle to a weak base theory that includes weak König's Lemma and a substantial amount of $\Sigma^0_1$-induction (enough to prove the totality of all primitive recursive functions but not of all primitive recursive functionals). (...)
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  14. William J. Collins & Paul Young (1983). Discontinuities of Provably Correct Operators on the Provably Recursive Real Numbers. Journal of Symbolic Logic 48 (4):913-920.score: 30.0
    In this paper we continue, from [2], the development of provably recursive analysis, that is, the study of real numbers defined by programs which can be proven to be correct in some fixed axiom system S. In particular we develop the provable analogue of an effective operator on the set C of recursive real numbers, namely, a provably correct operator on the set P of provably recursive real numbers. In Theorems 1 and 2 we exhibit a provably (...)
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  15. Melvin Fitting (1987). Computability Theory, Semantics, and Logic Programming. Clarendon Press.score: 30.0
    This book describes computability theory and provides an extensive treatment of data structures and program correctness. It makes accessible some of the author's work on generalized recursion theory, particularly the material on the logic programming language PROLOG, which is currently of great interest. Fitting considers the relation of PROLOG logic programming to the LISP type of language.
     
    My bibliography  
     
    Export citation  
  16. Karl-Heinz Niggl (1998). A Restricted Computation Model on Scott Domains and its Partial Primitive Recursive Functionals. Archive for Mathematical Logic 37 (7):443-481.score: 30.0
    The paper builds on both a simply typed term system ${\cal PR}^\omega$ and a computation model on Scott domains via so-called parallel typed while programs (PTWP). The former provides a notion of partial primitive recursive functional on Scott domains $D_\rho$ supporting a suitable concept of parallelism. Computability on Scott domains seems to entail that Kleene's schema of higher type simultaneous course-of-values recursion (scvr) is not reducible to partial primitive recursion. So extensions ${\cal PR}^{\omega e}$ and PTWP $^e$ are studied (...)
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  17. Steve Awodey, Type Theory and Homotopy.score: 24.0
    of type theory has been used successfully to formalize large parts of constructive mathematics, such as the theory of generalized recursive definitions [NPS90, ML79]. Moreover, it is also employed extensively as a framework for the development of high-level programming languages, in virtue of its combination of expressive strength and desirable proof-theoretic properties [NPS90, Str91]. In addition to simple types A, B, . . . and their terms x : A b(x) : B, the theory also has dependent types (...)
    No categories
    Translate to English
    | Direct download  
     
    My bibliography  
     
    Export citation  
  18. Giuseppe Longo & Pierre-Emmanuel Tendero (2007). The Differential Method and the Causal Incompleteness of Programming Theory in Molecular Biology. Foundations of Science 12 (4):337-366.score: 24.0
    The “DNA is a program” metaphor is still widely used in Molecular Biology and its popularization. There are good historical reasons for the use of such a metaphor or theoretical model. Yet we argue that both the metaphor and the model are essentially inadequate also from the point of view of Physics and Computer Science. Relevant work has already been done, in Biology, criticizing the programming paradigm. We will refer to empirical evidence and theoretical writings in Biology, although our (...)
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  19. J. Roger Hindley (1986). Introduction to Combinators and [Lambda]-Calculus. Cambridge University Press.score: 24.0
    Combinatory logic and lambda-conversion were originally devised in the 1920s for investigating the foundations of mathematics using the basic concept of 'operation' instead of 'set'. They have now developed into linguistic tools, useful in several branches of logic and computer science, especially in the study of programming languages. These notes form a simple introduction to the two topics, suitable for a reader who has no previous knowledge of combinatory logic, but has taken an undergraduate course in predicate calculus and (...)
    Direct download  
     
    My bibliography  
     
    Export citation  
  20. Raymond Turner (2007). Understanding Programming Languages. Minds and Machines 17 (2):203-216.score: 24.0
    We document the influence on programming language semantics of the Platonism/formalism divide in the philosophy of mathematics.
    Direct download (10 more)  
     
    My bibliography  
     
    Export citation  
  21. Enrique Frias-Martinez & Fernand Gobet (2007). Automatic Generation of Cognitive Theories Using Genetic Programming. Minds and Machines 17 (3):287-309.score: 24.0
    Cognitive neuroscience is the branch of neuroscience that studies the neural mechanisms underpinning cognition and develops theories explaining them. Within cognitive neuroscience, computational neuroscience focuses on modeling behavior, using theories expressed as computer programs. Up to now, computational theories have been formulated by neuroscientists. In this paper, we present a new approach to theory development in neuroscience: the automatic generation and testing of cognitive theories using genetic programming (GP). Our approach evolves from experimental data cognitive theories that explain “the (...)
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  22. Karel Lambert (2001). From Predication to Programming. Minds and Machines 11 (2):257-265.score: 24.0
    A free logic is one in which a singular term can fail to refer to an existent object, for example, `Vulcan' or `5/0'. This essay demonstrates the fruitfulness of a version of this non-classical logic of terms (negative free logic) by showing (1) how it can be used not only to repair a looming inconsistency in Quine's theory of predication, the most influential semantical theory in contemporary philosophical logic, but also (2) how Beeson, Farmer and Feferman, among others, use it (...)
    Direct download (11 more)  
     
    My bibliography  
     
    Export citation  
  23. José Saias & Paulo Quaresma (2004). A Methodology to Create Legal Ontologies in a Logic Programming Based Web Information Retrieval System. Artificial Intelligence and Law 12 (4):397-417.score: 24.0
    Web legal information retrieval systems need the capability to reason with the knowledge modeled by legal ontologies. Using this knowledge it is possible to represent and to make inferences about the semantic content of legal documents. In this paper a methodology for applying NLP techniques to automatically create a legal ontology is proposed. The ontology is defined in the OWL semantic web language and it is used in a logic programming framework, EVOLP+ISCO, to allow users to query the semantic (...)
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  24. Domenico Zambella & Antonella Mancini (2001). A Note on Recursive Models of Set Theories. Notre Dame Journal of Formal Logic 42 (2):109-115.score: 24.0
    We construct two recursive models of fragments of set theory. We also show that the fragments of Kripke-Platek set theory that prove -induction for -formulas have no recursive models but the standard model of the hereditarily finite sets.
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  25. Daniel E. Severin (2008). Unary Primitive Recursive Functions. Journal of Symbolic Logic 73 (4):1122-1138.score: 24.0
    In this article, we study some new characterizations of primitive recursive functions based on restricted forms of primitive recursion, improving the pioneering work of R. M. Robinson and M. D. Gladstone. We reduce certain recursion schemes (mixed/pure iteration without parameters) and we characterize one-argument primitive recursive functions as the closure under substitution and iteration of certain optimal sets.
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  26. Yining Wu, Martin Caminada & Dov M. Gabbay (2009). Complete Extensions in Argumentation Coincide with 3-Valued Stable Models in Logic Programming. Studia Logica 93 (2/3):383 - 403.score: 24.0
    In this paper, we prove the correspondence between complete extensions in abstract argumentation and 3-valued stable models in logic programming. This result is in line with earlier work of [6] that identified the correspondence between the grounded extension in abstract argumentation and the well-founded model in logic programming, as well as between the stable extensions in abstract argumentation and the stable models in logic programming.
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  27. Jean-Gabriel Ganascia (2007). Modelling Ethical Rules of Lying with Answer Set Programming. Ethics and Information Technology 9 (1):39-47.score: 24.0
    There has been considerable discussion in the past about the assumptions and basis of different ethical rules. For instance, it is commonplace to say that ethical rules are defaults rules, which means that they tolerate exceptions. Some authors argue that morality can only be grounded in particular cases while others defend the existence of general principles related to ethical rules. Our purpose here is not to justify either position, but to try to model general ethical rules with artificial intelligence formalisms (...)
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  28. Raymond Turner (2014). Programming Languages as Technical Artifacts. Philosophy and Technology 27 (3):377-397.score: 24.0
    Taken at face value, a programming language is defined by a formal grammar. But, clearly, there is more to it. By themselves, the naked strings of the language do not determine when a program is correct relative to some specification. For this, the constructs of the language must be given some semantic content. Moreover, to be employed to generate physical computations, a programming language must have a physical implementation. How are we to conceptualize this complex package? Ontologically, what (...)
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  29. Sujoy Chakravarty & Jaideep Roy (2009). Recursive Expected Utility and the Separation of Attitudes Towards Risk and Ambiguity: An Experimental Study. [REVIEW] Theory and Decision 66 (3):199-228.score: 24.0
    We use the multiple price list method and a recursive expected utility theory of smooth ambiguity to separate out attitude towards risk from that towards ambiguity. Based on this separation, we investigate if there are differences in agent behaviour under uncertainty over gain amounts vis-a-vis uncertainty over loss amounts. On an aggregate level, we find that (i) subjects are risk averse over gains and risk seeking over losses, displaying a “reflection effect” and (ii) they are ambiguity neutral over gains (...)
    No categories
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  30. Michael Gabbay (2011). A Proof-Theoretic Treatment of Λ-Reduction with Cut-Elimination: Λ-Calculus as a Logic Programming Language. Journal of Symbolic Logic 76 (2):673 - 699.score: 24.0
    We build on an existing a term-sequent logic for the λ-calculus. We formulate a general sequent system that fully integrates αβη-reductions between untyped λ-terms into first order logic. We prove a cut-elimination result and then offer an application of cut-elimination by giving a notion of uniform proof for λ-terms. We suggest how this allows us to view the calculus of untyped αβ-reductions as a logic programming language (as well as a functional programming language, as it is traditionally seen).
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  31. Dag Normann (2000). Computability Over the Partial Continuous Functionals. Journal of Symbolic Logic 65 (3):1133-1142.score: 24.0
    We show that to every recursive total continuous functional Φ there is a PCF-definable representative Ψ of Φ in the hierarchy of partial continuous functionals, where PCF is Plotkin's programming language for computable functionals. PCF-definable is equivalent to Kleene's S1-S9-computable over the partial continuous functionals.
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  32. Helena Rasiowa (1979). Algorithmic Logic. Multiple-Valued Extensions. Studia Logica 38 (4):317 - 335.score: 24.0
    Extended algorithmic logic (EAL) as introduced in [18] is a modified version of extended +-valued algorithmic logic. Only two-valued predicates and two-valued propositional variables occur in EAL. The role of the +-valued logic is restricted to construct control systems (stacks) of pushdown algorithms whereas their actions are described by means of the two-valued logic. Thus EAL formalizes a programming theory with recursive procedures but without the instruction CASE.The aim of this paper is to discuss EAL and prove the (...)
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  33. Timothy R. Colburn (1991). Defeasible Reasoning and Logic Programming. Minds and Machines 1 (4):417-436.score: 24.0
    The general conditions of epistemic defeat are naturally represented through the interplay of two distinct kinds of entailment, deductive and defeasible. Many of the current approaches to modeling defeasible reasoning seek to define defeasible entailment via model-theoretic notions like truth and satisfiability, which, I argue, fails to capture this fundamental distinction between truthpreserving and justification-preserving entailments. I present an alternative account of defeasible entailment and show how logic programming offers a paradigm in which the distinction can be captured, (...)
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  34. Luis E. Sanchis (1992). Recursive Functionals. North-Holland.score: 24.0
    This work is a self-contained elementary exposition of the theory of recursive functionals, that also includes a number of advanced results.
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
  35. Özgür Kıbrıs (2013). On Recursive Solutions to Simple Allocation Problems. Theory and Decision 75 (3):449-463.score: 24.0
    We propose and axiomatically analyze a class of rational solutions to simple allocation problems where a policy-maker allocates an endowment $E$ among $n$ agents described by a characteristic vector c. We propose a class of recursive rules which mimic a decision process where the policy-maker initially starts with a reference allocation of $E$ in mind and then uses the data of the problem to recursively adjust his previous allocation decisions. We show that recursive rules uniquely satisfy rationality, c-continuity, (...)
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  36. Vitali Tselishchev (2008). Intuition and Reality of Signs. Proceedings of the Xxii World Congress of Philosophy 41:57-63.score: 24.0
    The progress in computer programming leads to the shift in traditional correlation between intuitive and formal components of mathematical knowledge. From epistemological point of view the role of intuition decreases in compare with formal representation of mathematical structures. The relevant explanation is to be found in D. Hilbert’s formalism and corresponding Kantian’s motives in it. The notion of sign belongs to both areas under consideration: on the one hand it is object of intuition in Kantian de re sense, on (...)
    No categories
    Translate to English
    | Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  37. Ian H. Witten, Bruce A. MacDonald, David L. Maulsby & Rosanna Heise (1992). Programming by Example: The Human Face of AI. [REVIEW] AI and Society 6 (2):166-180.score: 24.0
    It is argued that “human-centredness” will be an important characteristic of systems that learn tasks from human users, as the difficulties in inductive inference rule out learning without human assistance. The aim of “programming by example” is to create systems that learn how to perform tasks from their human users by being shown examples of what is to be done. Just as the user creates a learning environment for the system, so the system provides a teaching opportunity for the (...)
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  38. Herbert B. Enderton (2011). Computability Theory: An Introduction to Recursion Theory. Academic Press.score: 22.0
    Machine generated contents note: 1. The Computability Concept;2. General Recursive Functions;3. Programs and Machines;4. Recursive Enumerability;5. Connections to Logic;6. Degrees of Unsolvability;7. Polynomial-Time Computability;Appendix: Mathspeak;Appendix: Countability;Appendix: Decadic Notation;.
    Direct download  
     
    My bibliography  
     
    Export citation  
  39. Alexander P. Kreuzer (2013). Program Extraction for 2-Random Reals. Archive for Mathematical Logic 52 (5-6):659-666.score: 22.0
    Let ${2-\textsf{RAN}}$ be the statement that for each real X a real 2-random relative to X exists. We apply program extraction techniques we developed in Kreuzer and Kohlenbach (J. Symb. Log. 77(3):853–895, 2012. doi:10.2178/jsl/1344862165), Kreuzer (Notre Dame J. Formal Log. 53(2):245–265, 2012. doi:10.1215/00294527-1715716) to this principle. Let ${{\textsf{WKL}_0^\omega}}$ be the finite type extension of ${\textsf{WKL}_0}$ . We obtain that one can extract primitive recursive realizers from proofs in ${{\textsf{WKL}_0^\omega} + \Pi^0_1-{\textsf{CP}} + 2-\textsf{RAN}}$ , i.e., if ${{\textsf{WKL}_0^\omega} + \Pi^0_1-{\textsf{CP}} + (...)
    No categories
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  40. Ver�Nica Becher, Santiago Figueira, Andr� Nies & Silvana Picchi (2005). Program Size Complexity for Possibly Infinite Computations. Notre Dame Journal of Formal Logic 46 (1):51-64.score: 22.0
    We define a program size complexity function as a variant of the prefix-free Kolmogorov complexity, based on Turing monotone machines performing possibly unending computations. We consider definitions of randomness and triviality for sequences in relative to the complexity. We prove that the classes of Martin-Löf random sequences and -random sequences coincide and that the -trivial sequences are exactly the recursive ones. We also study some properties of and compare it with other complexity functions. In particular, is different from , (...)
    Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  41. Alexander P. Kreuzer (2012). Primitive Recursion and the Chain Antichain Principle. Notre Dame Journal of Formal Logic 53 (2):245-265.score: 22.0
    Let the chain antichain principle (CAC) be the statement that each partial order on $\mathbb{N}$ possesses an infinite chain or an infinite antichain. Chong, Slaman, and Yang recently proved using forcing over nonstandard models of arithmetic that CAC is $\Pi^1_1$-conservative over $\text{RCA}_0+\Pi^0_1\text{-CP}$ and so in particular that CAC does not imply $\Sigma^0_2$-induction. We provide here a different purely syntactical and constructive proof of the statement that CAC (even together with WKL) does not imply $\Sigma^0_2$-induction. In detail we show using a (...)
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  42. Eugene Matusov & Mark Philip Smith (2011). An Ecological Model of Inter-Institutional Sustainability of an After-School Program: The La Red Mágica Community-University Partnership in Delaware. Outlines. Critical Practice Studies 13 (1):19-45.score: 22.0
    The purpose of the paper is to introduce a recursive model of ecological discursive sustainability, as it applies to and emerges from the history of an after-school program partnership between the School of Education at the University of Delaware, USA and the Latin American Community Center in Wilmington, Delaware, USA. This model is characterized by the development of shared ownership and collaboration between the institutional partners, the co-evolution and crossfertilization of the partners’ practices and the negotiation of institutional boundaries (...)
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  43. Virginie Lecomte, Neil A. Youngson, Christopher A. Maloney & Margaret J. Morris (2013). Parental Programming: How Can We Improve Study Design to Discern the Molecular Mechanisms? Bioessays 35 (9):787-793.score: 21.0
    Direct download (8 more)  
     
    My bibliography  
     
    Export citation  
  44. Christopher J. Ash & Julia F. Knight (1996). Recursive Structures and Ershov's Hierarchy. Mathematical Logic Quarterly 42 (1):461-468.score: 21.0
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  45. D. K. Despotis & J. Siskos (1992). Agricultural Management Using the ADELAIS Multiobjective Linear Programming Software: A Case Application. Theory and Decision 32 (2):113-131.score: 21.0
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  46. N. D. Jones (1997). Computability and Complexity: From a Programming Perspective Vol. 21. Mit Press.score: 21.0
    This makes his book especially valuable." -- Yuri Gurevich, Professor of Computer Science, University of Michigan Computability and complexity theory should be of central concern to practitioners as well as theorists.
    Direct download  
     
    My bibliography  
     
    Export citation  
  47. Iraj Kalantari & Larry Welch (2004). Density and Baire Category in Recursive Topology. Mathematical Logic Quarterly 50 (4‐5):381-391.score: 21.0
    No categories
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  48. Holger Petersen (1996). The Computation of Partial Recursive Word‐Functions Without Read Instructions. Mathematical Logic Quarterly 42 (1):312-318.score: 21.0
    No categories
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  49. Klaus‐Hilmar Sprenger (1997). Some Hierarchies of Primitive Recursive Functions on Term Algebras. Mathematical Logic Quarterly 43 (2):251-286.score: 21.0
    No categories
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  50. Christopher J. Ash & Julia F. Knight (1994). A Completeness Theorem for Certain Classes of Recursive Infinitary Formulas. Mathematical Logic Quarterly 40 (2):173-181.score: 21.0
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
1 — 50 / 1000