Search Results Heading

MBRLSearchResults

mbrl.module.common.modules.added.book.to.shelf
Title added to your shelf!
View what I already have on My Shelf.
Oops! Something went wrong.
Oops! Something went wrong.
While trying to add the title to your shelf something went wrong :( Kindly try again later!
Are you sure you want to remove the book from the shelf?
Oops! Something went wrong.
Oops! Something went wrong.
While trying to remove the title from your shelf something went wrong :( Kindly try again later!
    Done
    Filters
    Reset
  • Discipline
      Discipline
      Clear All
      Discipline
  • Is Peer Reviewed
      Is Peer Reviewed
      Clear All
      Is Peer Reviewed
  • Reading Level
      Reading Level
      Clear All
      Reading Level
  • Content Type
      Content Type
      Clear All
      Content Type
  • Year
      Year
      Clear All
      From:
      -
      To:
  • More Filters
      More Filters
      Clear All
      More Filters
      Item Type
    • Is Full-Text Available
    • Subject
    • Publisher
    • Source
    • Donor
    • Language
    • Place of Publication
    • Contributors
    • Location
49 result(s) for "Kossak, Roman"
Sort by:
THE LATTICE PROBLEM FOR MODELS OF$\\mathsf {PA}
The lattice problem for models of Peano Arithmetic ($\\mathsf {PA}$) is to determine which lattices can be represented as lattices of elementary submodels of a model of$\\mathsf {PA}$, or, in greater generality, for a given model$\\mathcal {M}$, which lattices can be represented as interstructure lattices of elementary submodels$\\mathcal {K}$of an elementary extension$\\mathcal {N}$such that$\\mathcal {M}\\preccurlyeq \\mathcal {K}\\preccurlyeq \\mathcal {N}$. The problem has been studied for the last 60 years and the results and their proofs show an interesting interplay between the model theory of PA, Ramsey style combinatorics, lattice representation theory, and elementary number theory. We present a survey of the most important results together with a detailed analysis of some special cases to explain and motivate a technique developed by James Schmerl for constructing elementary extensions with prescribed interstructure lattices. The last section is devoted to a discussion of lesser-known results about lattices of elementary submodels of countable recursively saturated models of PA.
Logic Without Borders
In the last decades, mathematical logic has developed into a technically quite sophisticated area of mathematics. Nevertheless, inspirations from philosophy and computer science continue to be important and noticeable. The series publishes conference proceedings as well as monographs written by leading researchers in mathematical logic.
Set Theory, Arithmetic, and Foundations of Mathematics
This collection of papers from various areas of mathematical logic showcases the remarkable breadth and richness of the field. Leading authors reveal how contemporary technical results touch upon foundational questions about the nature of mathematics. Highlights of the volume include: a history of Tennenbaum's theorem in arithmetic; a number of papers on Tennenbaum phenomena in weak arithmetics as well as on other aspects of arithmetics, such as interpretability; the transcript of Gödel's previously unpublished 1972–1975 conversations with Sue Toledo, along with an appreciation of the same by Curtis Franks; Hugh Woodin's paper arguing against the generic multiverse view; Anne Troelstra's history of intuitionism through 1991; and Aki Kanamori's history of the Suslin problem in set theory. The book provides a historical and philosophical treatment of particular theorems in arithmetic and set theory, and is ideal for researchers and graduate students in mathematical logic and philosophy of mathematics.
DISJUNCTIONS WITH STOPPING CONDITIONS
We introduce a tool for analysing models of CT⁻, the compositional truth theory over Peano Arithmetic. We present a new proof of Lachlan's theorem that the arithmetical part of models of CT⁻ are recursively saturated. We also use this tool to provide a new proof of theorem from [8] that all models of CT⁻ carry a partial inductive truth predicate. Finally, we construct a partial truth predicate defined for a set of formulae whose syntactic depth forms a nonstandard cut which cannot be extended to a full truth predicate satisfying CT⁻.
Logic without borders
In the last decades, mathematical logic has developed into a technically quite sophisticated area of mathematics. Nevertheless, inspirations from philosophy and computer science continue to be important and noticeable. The series publishes conference proceedings as well as monographs written by leading researchers in mathematical logic.
Is there Ethics in Mathematics?
This is a critical response to some arguments and general recommendations presented in a discussion paper Four Levels of Ethical Engagement [EiM Discussion Paper 1/2018 University of Cambridge Ethics in Mathematics Project, https://www.ethics-in-mathematics.com/assets/dp/18 1.pdf] by Maurice Chiodo and Piers Bursill-Hall. Much in their article is based on certain observations about characteristic psychological traits of mathematicians and their patterns of behavior that I find to be in stark contrast to my own observations. I argue against their assumptions and conclusions using examples.