Switch to: References

Add citations

You must login to add citations.
  1. The meaning of representation in animal memory.H. L. Roitblat - 1982 - Behavioral and Brain Sciences 5 (3):353-372.
    A representation is a remnant of previous experience that allows that experience to affect later behavior. This paper develops a metatheoretical view of representation and applies it to issues concerning representation in animals. To describe a representational system one must specify the following: thedomainor range of situations in the represented world to which the system applies; thecontentor set of features encoded and preserved by the system; thecodeor transformational rules relating features of the representation to the corresponding features of the represented (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   312 citations  
  • Enciclopédia de Termos Lógico-Filosóficos.João Miguel Biscaia Branquinho, Desidério Murcho & Nelson Gonçalves Gomes (eds.) - 2006 - São Paulo, SP, Brasil: Martins Fontes.
    Esta enciclopédia abrange, de uma forma introdutória mas desejavelmente rigorosa, uma diversidade de conceitos, temas, problemas, argumentos e teorias localizados numa área relativamente recente de estudos, os quais tem sido habitual qualificar como «estudos lógico-filosóficos». De uma forma apropriadamente genérica, e apesar de o território teórico abrangido ser extenso e de contornos por vezes difusos, podemos dizer que na área se investiga um conjunto de questões fundamentais acerca da natureza da linguagem, da mente, da cognição e do raciocínio humanos, bem (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  • Undecidability of the Problem of Recognizing Axiomatizations of Superintuitionistic Propositional Calculi.Evgeny Zolin - 2014 - Studia Logica 102 (5):1021-1039.
    We give a new proof of the following result : it is undecidable whether a given calculus, that is a finite set of propositional formulas together with the rules of modus ponens and substitution, axiomatizes the classical logic. Moreover, we prove the same for every superintuitionistic calculus. As a corollary, it is undecidable whether a given calculus is consistent, whether it is superintuitionistic, whether two given calculi have the same theorems, whether a given formula is derivable in a given calculus. (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  • The heuristic value of representation.Thomas R. Zentall - 1982 - Behavioral and Brain Sciences 5 (3):393-394.
  • The Necessity of Mathematics.Juhani Yli‐Vakkuri & John Hawthorne - 2018 - Noûs 52 (3):549-577.
    Some have argued for a division of epistemic labor in which mathematicians supply truths and philosophers supply their necessity. We argue that this is wrong: mathematics is committed to its own necessity. Counterfactuals play a starring role.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  • Some Non‐Recursive Classes of Thue Systems With Solvable Word Problem.Ann Yasuhara - 1974 - Mathematical Logic Quarterly 20 (8-12):121-132.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  • A notion of effectiveness in arbitrary structures.W. M. Lambert - 1968 - Journal of Symbolic Logic 33 (4):577-602.
  • Mind the brain.Martha Wilson - 1982 - Behavioral and Brain Sciences 5 (3):393-393.
  • Internal representations and indeterminacy: A skeptical view.William R. Uttal - 1982 - Behavioral and Brain Sciences 5 (3):392-393.
  • The undecidability of entailment and relevant implication.Alasdair Urquhart - 1984 - Journal of Symbolic Logic 49 (4):1059-1073.
  • Complexity Level Analysis Revisited: What Can 30 Years of Hindsight Tell Us about How the Brain Might Represent Visual Information?John K. Tsotsos - 2017 - Frontiers in Psychology 8.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • Some Reflections on the Foundations of Ordinary Recursion Theory and a New Proposal.George Tourlakis - 1986 - Mathematical Logic Quarterly 32 (31-34):503-515.
  • Algorithms and the Practical World.Paolo Totaro & Domenico Ninno - 2016 - Theory, Culture and Society 33 (1):139-152.
    This article is both a comment on Neyland’s ‘On organizing algorithms’ and a supplementary note to our ‘The concept of algorithm as an interpretative key of modern rationality’. In the first part we discuss the concepts of algorithm and recursive function from a different perspective from that of our previous article. Our cultural reference for these concepts is once again computability theory. We give additional arguments in support of the idea that a culture informed by an algorithmic logic has promoted (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  • Intension in terms of Turing machines.Pavel Tichý - 1969 - Studia Logica 24 (1):7 - 25.
  • Animal versus human minds.H. S. Terrace - 1982 - Behavioral and Brain Sciences 5 (3):391-392.
  • Address at the Princeton University Bicentennial Conference on Problems of Mathematics (December 17–19, 1946), By Alfred Tarski. [REVIEW]Alfred Tarski & Hourya Sinaceur - 2000 - Bulletin of Symbolic Logic 6 (1):1-44.
    This article presents Tarski's Address at the Princeton Bicentennial Conference on Problems of Mathematics, together with a separate summary. Two accounts of the discussion which followed are also included. The central topic of the Address and of the discussion is decision problems. The introductory note gives information about the Conference, about the background of the subjects discussed in the Address, and about subsequent developments to these subjects.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  • In the beginning was the word.J. E. R. Staddon - 1982 - Behavioral and Brain Sciences 5 (3):390-391.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  • Some properties ofm-address machines.Zofia Sozańska-Bień - 1970 - Studia Logica 26 (1):19 - 34.
  • Some results on measure independent gödel speed-ups.Martin K. Solomon - 1978 - Journal of Symbolic Logic 43 (4):667-672.
    We study the measure independent character of Godel speed-up theorems. In particular, we strengthen Arbib's necessary condition for the occurrence of a Godel speed-up [2, p. 13] to an equivalence result and generalize Di Paola's speed-up theorem [4]. We also characterize undecidable theories as precisely those theories which possess consistent measure independent Godel speed-ups and show that a theory τ 2 is a measure independent Godel speed-up of a theory τ 1 if and only if the set of undecidable sentences (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • Computability and recursion.Robert I. Soare - 1996 - Bulletin of Symbolic Logic 2 (3):284-321.
    We consider the informal concept of "computability" or "effective calculability" and two of the formalisms commonly used to define it, "(Turing) computability" and "(general) recursiveness". We consider their origin, exact technical definition, concepts, history, general English meanings, how they became fixed in their present roles, how they were first and are now used, their impact on nonspecialists, how their use will affect the future content of the subject of computability theory, and its connection to other related areas. After a careful (...)
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark   51 citations  
  • Historicism, behaviorism, and the conceptual status of memory representations in animals.Charles P. Shimp - 1982 - Behavioral and Brain Sciences 5 (3):389-390.
  • Expectancy: The endogenous source of anticipatory activities, including “pseudoconditioned” responses.Patrick J. Sheafor - 1982 - Behavioral and Brain Sciences 5 (3):387-389.
  • Metatheory of animal behavior.Erwin M. Segal - 1982 - Behavioral and Brain Sciences 5 (3):386-387.
  • Zwei Unentscheidbare Probleme Der Analysis.Bruno Scarpellini - 1963 - Mathematical Logic Quarterly 9 (18-20):265-289.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   10 citations  
  • A New Realizability Notion for Intuitionistic Analysis.B. Scarpellini - 1977 - Mathematical Logic Quarterly 23 (7‐12):137-167.
    Direct download  
     
    Export citation  
     
    Bookmark  
  • The logic of representation.William W. Rozeboom - 1982 - Behavioral and Brain Sciences 5 (3):385-386.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  • Representations and cognition.H. L. Roitblat - 1982 - Behavioral and Brain Sciences 5 (3):394-406.
  • Premature closure of controversial issues concerning animal memory representations.William A. Roberts - 1982 - Behavioral and Brain Sciences 5 (3):384-385.
  • Trial and error predicates and the solution to a problem of Mostowski.Hilary Putnam - 1965 - Journal of Symbolic Logic 30 (1):49-57.
  • An unsolvable problem in number theory.Hilary Putnam - 1960 - Journal of Symbolic Logic 25 (3):220-232.
  • Alan Turing and the mathematical objection.Gualtiero Piccinini - 2003 - Minds and Machines 13 (1):23-48.
    This paper concerns Alan Turing’s ideas about machines, mathematical methods of proof, and intelligence. By the late 1930s, Kurt Gödel and other logicians, including Turing himself, had shown that no finite set of rules could be used to generate all true mathematical statements. Yet according to Turing, there was no upper bound to the number of mathematical truths provable by intelligent human beings, for they could invent new rules and methods of proof. So, the output of a human mathematician, for (...)
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark   25 citations  
  • On the content of representations.R. J. Nelson - 1982 - Behavioral and Brain Sciences 5 (3):384-384.
  • Some thoughts on the proper foundations for the study of cognition in animals.Lynn Nadel - 1982 - Behavioral and Brain Sciences 5 (3):383-384.
  • The Vectorized Grzegorczyk Hierarchy.Steven S. Muchnick - 1976 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 22 (1):441-480.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark  
  • Computational speed-up by effective operators.Albert R. Meyer & Patrick C. Fischer - 1972 - Journal of Symbolic Logic 37 (1):55-68.
  • A Classification of the Recursive Functions.Albert R. Meyer & Dennis M. Ritchie - 1972 - Mathematical Logic Quarterly 18 (4‐6):71-82.
  • Alan Turing and the origins of complexity.Miguel Angel Martin-Delgado - 2013 - Arbor 189 (764):a083.
  • A la représentation du temps perdu.John C. Marshall - 1982 - Behavioral and Brain Sciences 5 (3):382-383.
  • Undecidable semiassociative relation algebras.Roger D. Maddux - 1994 - Journal of Symbolic Logic 59 (2):398-418.
    If K is a class of semiassociative relation algebras and K contains the relation algebra of all binary relations on a denumerable set, then the word problem for the free algebra over K on one generator is unsolvable. This result implies that the set of sentences which are provable in the formalism Lwx is an undecidable theory. A stronger algebraic result shows that the set of logically valid sentences in Lwx forms a hereditarily undecidable theory in Lwx. These results generalize (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  • The equational theory of CA 3 is undecidable.Roger Maddux - 1980 - Journal of Symbolic Logic 45 (2):311 - 316.
  • Cognitive psychology's representation of behaviorism.A. W. Logue - 1982 - Behavioral and Brain Sciences 5 (3):381-382.
  • A survey of partial degrees.Leonard P. Sasso - 1975 - Journal of Symbolic Logic 40 (2):130-140.
  • The Priority Method I.A. H. Lachlans - 1967 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 13 (1-2):1-10.
  • Memory representations in animals: Some metatheoretical issues.Roy Lachman & Janet L. Lachman - 1982 - Behavioral and Brain Sciences 5 (3):380-381.
  • Some Properties of Machines.W. Kwasowiec - 1970 - Mathematical Logic Quarterly 16 (8):399-404.
  • Predictably computable functionals and definition by recursion.D. L. Kreider & R. W. Ritchie - 1964 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 10 (5):65-80.
  • A Basis Theorem for a Class of Two-Way Automata.D. L. Kreider & R. W. Ritchie - 1966 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 12 (1):243-255.
    Direct download  
     
    Export citation  
     
    Bookmark  
  • On Formalism Freeness: Implementing Gödel's 1946 Princeton Bicentennial Lecture.Juliette Kennedy - 2013 - Bulletin of Symbolic Logic 19 (3):351-393.
    In this paper we isolate a notion that we call “formalism freeness” from Gödel's 1946 Princeton Bicentennial Lecture, which asks for a transfer of the Turing analysis of computability to the cases of definability and provability. We suggest an implementation of Gödel's idea in the case of definability, via versions of the constructible hierarchy based on fragments of second order logic. We also trace the notion of formalism freeness in the very wide context of developments in mathematical logic in the (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  • Classification of Quantifier Prefixes Over Diophantine Equations.James P. Jones - 1981 - Mathematical Logic Quarterly 27 (25‐30):403-410.
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Classification of Quantifier Prefixes Over Diophantine Equations.James P. Jones - 1981 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 27 (25-30):403-410.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation