Switch to: References

Add citations

You must login to add citations.
  1. Why Can Computers Understand Natural Language?Juan Luis Gastaldi - 2020 - Philosophy and Technology 34 (1):149-214.
    The present paper intends to draw the conception of language implied in the technique of word embeddings that supported the recent development of deep neural network models in computational linguistics. After a preliminary presentation of the basic functioning of elementary artificial neural networks, we introduce the motivations and capabilities of word embeddings through one of its pioneering models, word2vec. To assess the remarkable results of the latter, we inspect the nature of its underlying mechanisms, which have been characterized as the (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Forcing under Anti‐Foundation Axiom: An expression of the stalks.Sato Kentaro - 2006 - Mathematical Logic Quarterly 52 (3):295-314.
    We introduce a new simple way of defining the forcing method that works well in the usual setting under FA, the Foundation Axiom, and moreover works even under Aczel's AFA, the Anti-Foundation Axiom. This new way allows us to have an intuition about what happens in defining the forcing relation. The main tool is H. Friedman's method of defining the extensional membership relation ∈ by means of the intensional membership relation ε .Analogously to the usual forcing and the usual generic (...)
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • Delimited control operators prove Double-negation Shift.Danko Ilik - 2012 - Annals of Pure and Applied Logic 163 (11):1549-1559.
    We propose an extension of minimal intuitionistic predicate logic, based on delimited control operators, that can derive the predicate-logic version of the double-negation shift schema, while preserving the disjunction and existence properties.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • From abstraction and indiscernibility to classification and types.Jean-Baptiste Joinet & Thomas Seiller - 2021 - Kagaku Tetsugaku 53 (2):65-93.
    Download  
     
    Export citation  
     
    Bookmark  
  • The Limits of Computation.Andrew Powell - 2022 - Axiomathes 32 (6):991-1011.
    This article provides a survey of key papers that characterise computable functions, but also provides some novel insights as follows. It is argued that the power of algorithms is at least as strong as functions that can be proved to be totally computable in type-theoretic translations of subsystems of second-order Zermelo Fraenkel set theory. Moreover, it is claimed that typed systems of the lambda calculus give rise naturally to a functional interpretation of rich systems of types and to a hierarchy (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Interaction graphs: Graphings.Thomas Seiller - 2017 - Annals of Pure and Applied Logic 168 (2):278-320.
    Download  
     
    Export citation  
     
    Bookmark  
  • Interaction graphs: Additives.Thomas Seiller - 2016 - Annals of Pure and Applied Logic 167 (2):95-154.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Wittgenstein et le lien entre la signification d’un énoncé mathématique et sa preuve.Mathieu Marion & Mitsuhiro Okada - 2012 - Philosophiques 39 (1):101-124.
    The thesis according to which the meaning of a mathematical sentence is given by its proof was held by both Wittgenstein and the intuitionists, following Heyting and Dummett. In this paper, we clarify the meaning of this thesis for Wittgenstein, showing how his position differs from that of the intuitionists. We show how the thesis originates in his thoughts, from the middle period, about proofs by induction, and we sketch his answers to a number of objections, including the idea that, (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Realizability for Peano arithmetic with winning conditions in HON games.Valentin Blot - 2017 - Annals of Pure and Applied Logic 168 (2):254-277.
    Download  
     
    Export citation  
     
    Bookmark   1 citation