Mostrando recursos 1 - 20 de 737

  1. Notices, Bull. Symbolic Logic 19, iss. 3 (2013)


  2. 19th Workshop on Logic, Language, Information and Computation (WoLLIC 2012), Buenos Aires, Argentina, September 3—6, 2012


  3. XV Latin American Symposium on Mathematical Logic (SLALM 2012), Bogotá, Colombia, June 4—8, 2012


  4. Reviews, Bull. Symbolic Logic 19, iss. 3 (2013)


  5. On formalism freeness: Implementing Gödel's 1946 Princeton bicentennial lecture

    Kennedy, Juliette
    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 20th century.

  6. Algorithmic randomness and measures of complexity

    Barmpalias, George
    We survey recent advances on the interface between computability theory and algorithmic randomness, with special attention on measures of relative complexity. We focus on (weak) reducibilities that measure (a) the initial segment complexity of reals and (b) the power of reals to compress strings, when they are used as oracles. The results are put into context and several connections are made with various central issues in modern algorithmic randomness and computability.

  7. Interpretability in Robinson's Q

    Ferreira, Fernando; Ferreira, Gilda
    Edward Nelson published in 1986 a book defending an extreme formalist view of mathematics according to which there is an impassable barrier in the totality of exponentiation. On the positive side, Nelson embarks on a program of investigating how much mathematics can be interpreted in Raphael Robinson's theory of arithmetic Q. In the shadow of this program, some very nice logical investigations and results were produced by a number of people, not only regarding what can be interpreted in Q but also what cannot be so interpreted. We explain some of these results and rely on them to discuss Nelson's position.

  8. Notices, Bull. Symbolic Logic 19, iss. 4 (2013)


  9. Members of the Association


  10. Officers and Committees of the Association for Symbolic Logic


  11. 24th European Summer School on Logic, Language and Information (ESSLLI 2012), Opole University, Opole, Poland, August 6—17, 2012


  12. 2013 Winter Meeting of the Association for Symbolic Logic, The Hilton New Orleans Riverside Hotel, New Orleans, Louisiana, February 20—21, 2013


  13. 2012—2013 Winter Meeting of the Association for Symbolic Logic, San Diego Convention Center, San Diego Marriott Marquis and Marina, San Diego, CA, January 11—12, 2013


  14. Reviews, Bull. Symbolic Logic 19, iss. 4 (2013)


  15. Analytic equivalence relations and the forcing method

    Zapletal, Jindřich
    I describe several ways in which forcing arguments can be used to yield clean and conceptual proofs of nonreducibility, ergodicity and other results in the theory of analytic equivalence relations. In particular, I present simple Borel equivalence relations $E, F$ such that a natural proof of nonreducibility of $E$ to $F$ uses the independence of the Singular Cardinal Hypothesis at $\aleph_\omega$.

  16. Logic in the 1930s: type theory and model theory

    Schiemer, Georg; Reck, Erich H.
    In historical discussions of twentieth-century logic, it is typically assumed that model theory emerged within the tradition that adopted first-order logic as the standard framework. Work within the type-theoretic tradition, in the style of Principia Mathematica, tends to be downplayed or ignored in this connection. Indeed, the shift from type theory to first-order logic is sometimes seen as involving a radical break that first made possible the rise of modern model theory. While comparing several early attempts to develop the semantics of axiomatic theories in the 1930s, by two proponents of the type-theoretic tradition (Carnap and Tarski) and two proponents of the first-order tradition (Gödel and Hilbert), we argue that,...

  17. Notices, Bull. Symbolic Logic 19, iss. 2 (2013)


  18. Twelfth Asian Logic Conference, Victoria University of Wellington, Wellington, New Zealand, December 15—20, 2011, with Student Day on December 14, 2011


  19. 2012 North American Annual Meeting of the Association for Symbolic Logic, University of Wisconsin, Madison, WI, USA, March 31—April 3, 2012


  20. 2011—2012 Winter Meeting of the Association for Symbolic Logic, John B. Hynes Veterans Memorial Convention Center Boston Marriott Hotel, and Boston Sheraton Hotel, Boston, MA, January 6—7, 2012


Aviso de cookies: Usamos cookies propias y de terceros para mejorar nuestros servicios, para análisis estadístico y para mostrarle publicidad. Si continua navegando consideramos que acepta su uso en los términos establecidos en la Política de cookies.