Logic Seminar 6 Nov 2024 17:00 hrs by Michael Takaaki Leong at NUS
This Week in Logic at CUNY
- - - - Monday, Nov 4, 2024 - - - -
Logic and Metaphysics Workshop
Date: Monday, November 4, 4.15-6.15pm (NY time)
Room: Graduate Center Room 4419
Title: Logic and discrimination
Abstract: My talk is about the connection between logic and discrimination, with special focus on Plumwood’s ideas in her groundbreaking article ‘The Politics of Reason. Towards a Feminist Logic’ (1993). Although Plumwood’s paper is not focused on the notion of discrimination, what she writes is useful for illuminating some basic mechanisms of thought that are at the basis of discriminatory practices. After an introductory section about the concepts of logic and discrimination at the basis of my analysis, I present Plumwood’s ideas in 1993 with a special focus on their relevance for understanding the nature of discrimination. More specifically, I use examples of discriminatory practices that make the connection between logical operations and oppression envisaged by Plumwood clear. I focus especially on two questions: Can logic produce discrimination? Can logic contribute to the fight against discrimination? If so, how?
- - - - Tuesday, Nov 5, 2024 - - - -
- - - - Wednesday, Nov 6, 2024 - - - -
Philosophy Colloquium
Wednesday Nov 6, 4:15 P.M. to 6:15 P.M, CUNY Graduate Center Room 9206/9207
“A Chancy Theory of Counterfactuals”
The New York City Category Theory Seminar
Department of Computer Science
Department of Mathematics
The Graduate Center of The City University of New York
Speaker: David Jaz Myers, NYU Abu Dhabi.
Date and Time: Wednesday November 6, 2024, SPECIAL TIME: 2:00 PM NYC TIME (contact N Yanofsky noson@sci.brooklyn.cuny.edu for zoom link)
Title: Contextads: Para and Kleisli constructions as wreath products.
Abstract: Given a comonad D on a category C, we can produce a double category whose tight maps are those of C and whose loose maps are Kleisli maps for D --- this is the Kleisli double category kl(D). Given a monoidal right action & : C x M --> C, we can produce a double category Para(&) whose tight maps are those of C and whose loose maps A -|-> B are pairs (P, f : A & P --> B) of a parameter space P in M and a parameterised map f.
In this talk, we'll see both these as special cases of a general construction: the Ctx construction which takes a *contextad* on a (double) category and produces a new double category. We'll see that this construction is "just" the wreath product of pseudo-monads in Span(Cat). We'll then exploit this observation to find 2-algebraic structure on the Ctx constructions of suitably structured contextads; vastly generalizing the old observation that a colax monoidal comonad has a monoidal Kleisli category.
This is joint work with Matteo Capucci.
- - - - Thursday, Nov 7, 2024 - - - -
Thursday November 7, 2pm, Rutgers University, Hill Center, Hill 423
Generic dichotomies for Borel homomorphisms for the finite Friedman-Stanley jumps
- - - - Friday, Nov 8, 2024 - - - -
CUNY Graduate Center
Friday, November 8, 11:00am NY time, Room 3207
Hybrid: Please email Victoria Gitman (vgitman@gmail.com) for zoom info.
Geoff Galgon,
Distributivity and Base trees for
For a regular uncountable cardinal, we show that distributivity and base trees for of intermediate height in the cardinal interval exist in certain models. We also show that base trees of height can exist as well as base trees of various heights depending on the spectrum of cardinalities of towers in . These constructions answer questions of V. Fischer, M. Koelbing, and W. Wohofsky in certain models.
Logic Workshop
CUNY Graduate Center
Friday, November 8, 2:00pm-3:30pm, Room 4419
- - - - Monday, Nov 11, 2024 - - - -
Monday November 11, 3:30pm, Rutgers University, Hill Center, Hill 705
Date: Monday, November 11, 4.15-6.15pm (NY time)
Room: Graduate Center Room 4419
Friederike Moltmann (CNRS).
Title: On the ontology and semantics of absence
Abstract: This talk proposes a new semantic analysis of verbs of absence such as ‘lack’ and ‘be missing’. The semantics is based on the notion of a conceptual whole and its (conceptual) parts, which generates both variable embodiments (of the whole and its structural parts) and modal objects of the sort of a ‘lack’. It involves an extension of truthmaker semantics (applied to modal objects) where truthmakers (satisfiers) now include parts of wholes. The talk rehabilitates entities of the sort of ‘lacks’ often subject to ridicule, most notoriously by Chomsky.
- - - - Tuesday, Nov 12, 2024 - - - -
- - - - Wednesday, Nov 13, 2024 - - - -
Department of Computer Science
Department of Mathematics
The Graduate Center of The City University of New York
Date and Time: Wednesday November 13, 2024, 7:00 - 8:30 PM.IN-PERSON TALK. CUNY Graduate Center Room 6417
Title: Decision Problems on Graphs with Sheaves.
- - - - Thursday, Nov 14, 2024 - - - -
- - - - Friday, Nov 15, 2024 - - - -
CUNY Graduate Center
Friday, November 15, 11:00am NY time, Room 3207
Hybrid: Please email Victoria Gitman (vgitman@gmail.com) for zoom info.
Philipp Schlicht Kurt Gödel Research Center
Logic Workshop
CUNY Graduate Center
Friday, November 15, 2:00pm-3:30pm, Room 4419
Russell Miller, CUNY
Computable reductions on groups and fields
Hjorth and Thomas established that the complexity of the isomorphism problem for torsion-free abelian groups of finite rank grows dramatically higher as the rank increases: for each , there is no Borel function that maps each rank- group to a rank- group in such a way that . We say that there is no Borel reduction from isomorphism on to isomorphism on . (From lower to higher rank, in contrast, such a reduction is readily seen.) Fields of transcendence degree over have very similar computability properties to groups in . This being so, we extend their investigations to include the isomorphism relations on the classes of such fields. We show that there do exist reductions (not merely Borel, but actually computable, and moreover functorial) from each to the corresponding , and also from each to (which proves more challenging than it was for the groups!). It remains open whether a theorem analogous to that of Hjorth-Thomas holds for the fields, but we use the notion of countable reductions to show that the fundamental obstacle to a reduction from to is the uncountability of these spaces. This is joint work with Meng-Che 'Turbo' Ho and Julia Knight.
- - - - Other Logic News - - - -
- - - - Web Site - - - -
Find us on the web at: nylogic.github.io
(site designed, built & maintained by Victoria Gitman)
-------- ADMINISTRIVIA --------
To subscribe/unsubscribe to this list, please email your request to jreitz@citytech.cuny.edu.
If you have a logic-related event that you would like included in future mailings, please email jreitz@citytech.cuny.edu.
Set Theory in the United Kingdom, Cambridge, November 18, 2024
Summer School on Topology, dynamics, and logic in interaction, in Cetraro, Italy, September 1-5, 2025
Set theory and topology seminar 05.11.2024 Paweł Krupski
An update on hyperspaces of knots.
will be presented by
Paweł Krupski
Abstract: New properties of the hyperspaces of simple closed curves in the plane or in the 3-space will be presented. In particular, the hyperspace of polygonal knots is a sigma-compact, strongly countable-dimensional ANR which is an infinite-dimensional Cantor manifold. The hyperspace of tame knots is an absolute Borel, strongly infinite-dimensional Cantor manifold. Joint work with Krzysztof Omiljanowski.
Feel free to spread this information among Your colleagues.
I'm looking forward to seeing You,
on behalf of all the organizers,
PBN
About 15 minutes before the seminar we invite you for coffee and a chat in the social room.
***
Our webpages:
https://prac.im.pwr.edu.pl/~settheory
https://settheory.pwr.edu.pl/ (legacy page)
http://www.math.uni.wroc.pl/seminarium/topologia
Wednesday seminar and other events
This Week in Logic at CUNY
MOPA (Models of Peano Arithmetic)
Sun Mengzhou, National University of Singapore
The Kaufmann–Clote question on end extensions of models of arithmetic and the weak regularity principle
We investigate the end extendibility of models of arithmetic with restricted elementarity. By utilizing the restricted ultrapower construction in the second-order context, for each and any countable model of , we construct a proper -elementary end extension satisfying , which answers a question by Clote positively. We also give a characterization of countable models of in terms of their end extendibility similar to the case of . Along the proof, we will introduce a new type of regularity principles in arithmetic called the weak regularity principle, which serves as a bridge between the model's end extendibility and the amount of induction or collection it satisfies.
The talk is based on this paper from arxiv:2409.03527.
Monday October 28, 3:30pm, Rutgers University, Hill Center, Hill 705
Date: Monday, October 28, 4.15-6.15pm (NY time)
Room: Graduate Center Room 4419
- - - - Tuesday, Oct 29, 2024 - - - -
- - - - Wednesday, Oct 30, 2024 - - - -
The New York City Category Theory Seminar
Department of Computer Science
Department of Mathematics
The Graduate Center of The City University of New York
Date and Time: Wednesday October 30, 2024, 2:00PM NYC Time. NOTE SPECIAL TIME. ZOOM TALK (contact N Yanofsky noson@sci.brooklyn.cuny.edu for zoom link)
Speaker: Bruno Gavranović, Symbolica AI.
Title: Categorical Deep Learning: An Algebraic Theory of Architectures.Date and Time:
- - - - Thursday, Oct 31, 2024 - - - -
6th Saul Kripke Lecture
Abstract: The notion of a borderline case has been thought to be central to our understanding of vagueness. I shall argue that there is no intelligible notion that can play this role and that an alternative framework for understanding vagueness needs to be found.
- - - - Friday, Nov 1, 2024 - - - -
- - - - Monday, Nov 4, 2024 - - - -
Logic and Metaphysics Workshop
Date: Monday, November 4, 4.15-6.15pm (NY time)
Room: Graduate Center Room 4419
Title: Logic and discrimination
Abstract: My talk is about the connection between logic and discrimination, with special focus on Plumwood’s ideas in her groundbreaking article ‘The Politics of Reason. Towards a Feminist Logic’ (1993). Although Plumwood’s paper is not focused on the notion of discrimination, what she writes is useful for illuminating some basic mechanisms of thought that are at the basis of discriminatory practices. After an introductory section about the concepts of logic and discrimination at the basis of my analysis, I present Plumwood’s ideas in 1993 with a special focus on their relevance for understanding the nature of discrimination. More specifically, I use examples of discriminatory practices that make the connection between logical operations and oppression envisaged by Plumwood clear. I focus especially on two questions: Can logic produce discrimination? Can logic contribute to the fight against discrimination? If so, how?
- - - - Tuesday, Nov 5, 2024 - - - -
- - - - Wednesday, Nov 6, 2024 - - - -
The New York City Category Theory Seminar
Department of Computer Science
Department of Mathematics
The Graduate Center of The City University of New York
Speaker: David Jaz Myers, NYU Abu Dhabi.
Date and Time: Wednesday November 6, 2024, ZOOM TALK. TIME TBA (contact N Yanofsky noson@sci.brooklyn.cuny.edu for zoom link)
Title: Contextads: Para and Kleisli constructions as wreath products.
Abstract: Given a comonad D on a category C, we can produce a double category whose tight maps are those of C and whose loose maps are Kleisli maps for D --- this is the Kleisli double category kl(D). Given a monoidal right action & : C x M --> C, we can produce a double category Para(&) whose tight maps are those of C and whose loose maps A -|-> B are pairs (P, f : A & P --> B) of a parameter space P in M and a parameterised map f.
In this talk, we'll see both these as special cases of a general construction: the Ctx construction which takes a *contextad* on a (double) category and produces a new double category. We'll see that this construction is "just" the wreath product of pseudo-monads in Span(Cat). We'll then exploit this observation to find 2-algebraic structure on the Ctx constructions of suitably structured contextads; vastly generalizing the old observation that a colax monoidal comonad has a monoidal Kleisli category.
This is joint work with Matteo Capucci.
- - - - Thursday, Nov 7, 2024 - - - -
Thursday November 7, 2pm, Rutgers University, Hill Center, Hill 423
Generic dichotomies for Borel homomorphisms for the finite Friedman-Stanley jumps
- - - - Friday, Nov 8, 2024 - - - -
CUNY Graduate Center
Friday, November 8, 11:00am NY time, Room 3207
Hybrid: Please email Victoria Gitman (vgitman@gmail.com) for zoom info.
Geoff Galgon,
Distributivity and Base trees for
For a regular uncountable cardinal, we show that distributivity and base trees for of intermediate height in the cardinal interval exist in certain models. We also show that base trees of height can exist as well as base trees of various heights depending on the spectrum of cardinalities of towers in . These constructions answer questions of V. Fischer, M. Koelbing, and W. Wohofsky in certain models.
Logic Workshop
CUNY Graduate Center
Friday, November 8, 2:00pm-3:30pm, Room 4419
- - - - Other Logic News - - - -
- - - - Web Site - - - -
Find us on the web at: nylogic.github.io
(site designed, built & maintained by Victoria Gitman)
-------- ADMINISTRIVIA --------
To subscribe/unsubscribe to this list, please email your request to jreitz@citytech.cuny.edu.
If you have a logic-related event that you would like included in future mailings, please email jreitz@citytech.cuny.edu.
Set theory and topology seminar 31.10.2024 Carlos López Callejas
High dimensional sequential compactness
will be presented by
Carlos López Callejas
Abstract: In this talk, we will explore a multidimensional version of sequential compactness introduced by Kubis and Szeptycki, known as n-sequential compactness (n-sc), where n is a natural number. They demonstrated that this property holds in compact metric spaces and showed that it induces a hierarchy of sequential compactness; that is, for any n, if a space X is (n+1)-sc, then it is also n-sc. The question they pose is whether this hierarchy is strict—specifically, whether for each n, it is possible to construct a space that is n-sc but not (n+1)-sc. In this presentation, we will discuss some recent progress on this question and mention further generalizations of sequential compactness to any countable ordinal.
Feel free to spread this information among Your colleagues.
I'm looking forward to seeing You,
on behalf of all the organizers,
Szymon Żeberski
About 15 minutes before the seminar we invite you for coffee and a chat in the social room.
***
Our webpages:
https://prac.im.pwr.edu.pl/~settheory
https://settheory.pwr.edu.pl/ (legacy page)
http://www.math.uni.wroc.pl/seminarium/topologia
Set theory and topology seminar 29.10.2024 Francisco Santiago Nieto de la Rosa
A property of Laver forcing parameterized
will be presented by
Francisco Santiago Nieto de la Rosa
Abstract: Recently, Cieslak and Matinez-Celis have studied the Marczewski ideal associated with the Miller-Laver forcing \(m^0\) and \(l^0\). In particular, they considered parameterized versions of such forcings with ideals over omega (I) and considered the Marczewski ideal associated with these forcings \(m^0(I)\) and \(l^0(I)\). They are interested in studying the cofinality of such ideals. It is known that if the Laver forcing associated with I L(I) has the 1 to 1 or constant property, then \(l^0(I)\) has higher formality than the continuum. The mentioned mathematicians proved that for a certain class of ideals I, L(I) has the mentioned property, however they wonder what happens with ideals that do not belong to that class, specifically for Fin x Fin. In this talk we will give an affirmative answer to that question.
Feel free to spread this information among Your colleagues.
I'm looking forward to seeing You,
on behalf of all the organizers,
Szymon Żeberski
About 15 minutes before the seminar we invite you for coffee and a chat in the social room.
***
Our webpages:
https://prac.im.pwr.edu.pl/~settheory
https://settheory.pwr.edu.pl/ (legacy page)
http://www.math.uni.wroc.pl/seminarium/topologia
Set theory and topology seminar 29.10.2024 Ángel Jareb Navarro Castillo
Determinacy of Filter Games from the Closed-Set Covering Property
will be presented by
Ángel Jareb Navarro Castillo
Abstract: In this talk, we will prove the determinacy of some filter games (for example, \(G(F, \omega, F^∗)\) and \(G(F, [\omega]^{<\omega}, F^+)\)), assuming that the dual ideal satisfies the Closed-Set Covering Property. As corollaries, we obtain that these games are determined for every analytic filter (by a theorem of Solecki) and for every set in the Solovay model (by a theorem of Di Prisco and Todorcevic).
Feel free to spread this information among Your colleagues.
I'm looking forward to seeing You,
on behalf of all the organizers,
Szymon Żeberski
About 15 minutes before the seminar we invite you for coffee and a chat in the social room.
***
Our webpages:
https://prac.im.pwr.edu.pl/~settheory
https://settheory.pwr.edu.pl/ (legacy page)
http://www.math.uni.wroc.pl/seminarium/topologia
KGRC Set Theory talks October 28--October 31
Wednesday seminar + colloquium of the MLTCS department
Logic Seminar at NUS Wed 30 Oct 2024 by Desmond Lau
KGRC Set Theory talk October 24
This Week in Logic at CUNY
Monday October 21, 3:30pm, Rutgers University, Hill Center, Hill 705
Elementarity of Subgroups and Complexity of Theories for Profinite Groups
Date: Monday, October 21, 4.15-6.15pm (NY time)
Room: Graduate Center Room 4419
Title: Qua, per se, and other topic-transformative operators
Abstract: Recent work challenging principles of topic transparency in topic-sensitive logics has relied on providing accounts of connectives that are topic-transformative, that is, which non-trivially influence the overall topic assigned to a complex. This leads naturally to the question of what operators in natural language might also act as topic-transformative functions. This talk reviews work in progress studying “qua”, “per se”, and other topic-transformative operators. After discussing ways to analyze these operators, we will emphasize how such analyses are likely to assist in a parallel project of updating Richard Sylvan’s work on relevant containment logic.
Note: This is joint work with Pietro Vigiani (Pisa) and Jitka Kadlečková (Rensselaer).
- - - - Tuesday, Oct 22, 2024 - - - -
- - - - Wednesday, Oct 23, 2024 - - - -
- - - - Thursday, Oct 24, 2024 - - - -
- - - - Friday, Oct 25, 2024 - - - -
CUNY Graduate Center
Friday, October 25, 11:00am NY time, Room 3207
Hybrid: Please email Victoria Gitman (vgitman@gmail.com) for zoom info.
More Borel chromatic numbers
Borel chromatic numbers of definable graphs on Polish spaces have been studied for 25 years, starting with the seminal paper by Kechris, Solecky and Todorcevic. I will talk about some recent results about the consistent separation of uncountable Borel chromatic numbers of some particular graphs and about the Borel chromatic number of graphs related to Turing reducibility.
CUNY Graduate Center
Friday October 25, 2:00pm-3:30pm, Room 4419
Hans Schoutens, CUNY
Computing away negation using ancients: from existential to Diophantine sentences
Last semester, I discussed geometric methods for decidability over a complete discrete valuation ring (DVR) in equal characteristic, suggesting that these methods could be applied effectively. In this talk, I aim to clarify the computability issues surrounding this topic while at the same time shifting focus to the case of mixed characteristic. Whereas quantifier elimination (QE) results are established for p-adic numbers, the general landscape remains less explored. I will demonstrate that for any existential sentence over a computable ring, we can effectively construct a positive existential (or Diophantine) sentence which is logically equivalent to the original in every excellent Henselian DVR containing the ring. This construction hinges on Resolution of Singularities, which is feasible in characteristic zero.
Furthermore, I will utilize ultraproducts, specifically the protoproduct variant, to show how Diophantine statements over a DVR can be reduced to those over a residue ring. Since the residue ring is Artinian—and in the case of p-adics, even finite—the associated problems become significantly more manageable. However, it is important to note that this approach does not yet yield a general QE result, as it applies only to sentences, not formulas. The challenge lies in the dependence of certain effective bounds on parameters. I will provide insights into how to derive a bound based on a refined notion of complexity within the equational system—beyond simply considering its degree—using ultraproducts. Additionally, I will address a request from the audience in my last talk by demonstrating that this bound is indeed effective.
And somehow it will also require some delving into the theory of Witt vectors and ancient elements, as I will explain.- - - - Monday, Oct 28, 2024 - - - -
MOPA (Models of Peano Arithmetic)
Sun Mengzhou, National University of Singapore
The Kaufmann–Clote question on end extensions of models of arithmetic and the weak regularity principle
We investigate the end extendibility of models of arithmetic with restricted elementarity. By utilizing the restricted ultrapower construction in the second-order context, for each and any countable model of , we construct a proper -elementary end extension satisfying , which answers a question by Clote positively. We also give a characterization of countable models of in terms of their end extendibility similar to the case of . Along the proof, we will introduce a new type of regularity principles in arithmetic called the weak regularity principle, which serves as a bridge between the model's end extendibility and the amount of induction or collection it satisfies.
The talk is based on this paper from arxiv:2409.03527.
Monday October 28, 3:30pm, Rutgers University, Hill Center, Hill 705
Date: Monday, October 28, 4.15-6.15pm (NY time)
Room: Graduate Center Room 4419
- - - - Tuesday, Oct 29, 2024 - - - -
- - - - Wednesday, Oct 30, 2024 - - - -
The New York City Category Theory Seminar
Department of Computer Science
Department of Mathematics
The Graduate Center of The City University of New York
Date and Time: Wednesday October 30, 2024, 2:00PM NYC Time. NOTE SPECIAL TIME. ZOOM TALK (contact N Yanofsky noson@sci.brooklyn.cuny.edu for zoom link)
Speaker: Bruno Gavranović, Symbolica AI.
Title: Categorical Deep Learning: An Algebraic Theory of Architectures.Date and Time:
- - - - Thursday, Oct 31, 2024 - - - -
- - - - Friday, Nov 1, 2024 - - - -
- - - - Other Logic News - - - -
- - - - Web Site - - - -
Find us on the web at: nylogic.github.io
(site designed, built & maintained by Victoria Gitman)
-------- ADMINISTRIVIA --------
To subscribe/unsubscribe to this list, please email your request to jreitz@citytech.cuny.edu.
If you have a logic-related event that you would like included in future mailings, please email jreitz@citytech.cuny.edu.
Set theory and topology seminar 22.10.2024 Dominik Bargieła
(on behalf of the organizers, i.e. Piotr Borodulin-Nadzieja, Paweł Krupski, Aleksandra Kwiatkowska, Grzegorz Plebanek, Robert Rałowski and myself)
About 15 minutes before the seminar we invite you for coffee and a chat to social room.
https://prac.im.pwr.edu.pl/~settheory
http://www.math.uni.wroc.pl/seminarium/topologia
Logic Seminar at NUS on 23.10.2024 at 17:00 hrs by Ellen Hammatt
57th Nankai Logic Colloquium
This Week in Logic at CUNY
- - - - Monday, Oct 14, 2024 - - - -
Rutgers Logic Seminar
Monday October 13, 3:30pm, Rutgers University, Hill Center, Hill 705
From set theory to combinatorics of simplicial maps
- - - - Tuesday, Oct 15, 2024 - - - -
- - - - Wednesday, Oct 16, 2024 - - - -
- - - - Thursday, Oct 17, 2024 - - - -
- - - - Friday, Oct 18, 2024 - - - -
CUNY Graduate Center
Friday, October 18, 11:00am NY time, Room 3207
Hybrid: Please email Victoria Gitman (vgitman@gmail.com) for zoom info.
Hanul Jeon, Cornell University
On a cofinal Reinhardt embedding without Powerset
Reinhardt embedding is an elementary embedding from to itself, whose existence was refuted under the Axiom of Choice by Kunen's famous theorem. There were attempts to get a consistent version of a Reinhardt embedding, and dropping the Axiom of Powerset is one possibility. Richard Matthews showed that proves without Powerset is consistent with a Reinhardt embedding, but the embedding in the Matthews' model does not satisfy the cofinality (i.e., for every set there is such that ). In this talk, I will show from that without Powerset is consistent with a cofinal Reinhardt embedding.
CUNY Graduate Center
Friday October 18, 2:00pm-3:30pm, Room 4419
Brian Wynne, CUNY
Old and new decidability results for theories of Abelian lattice-ordered groups
An Abelian lattice-ordered group (l-group) is an Abelian group with a lattice order that is invariant under translations. Examples include , the set of continuous real-valued functions on a topological space with pointwise operations and order, the spaces, and certain spaces of measures. After surveying some of the known decidability results for various classes of l-groups, I will present new decidability results concerning existentially closed l-groups.
Next Week in Logic at CUNY:
- - - - Monday, Oct 21, 2024 - - - -
Monday October 21, 3:30pm, Rutgers University, Hill Center, Hill 705
Elementarity of Subgroups and Complexity of Theories for Profinite Groups
Date: Monday, October 21, 4.15-6.15pm (NY time)
Room: Graduate Center Room 4419
Title: Qua, per se, and other topic-transformative operators
Abstract: Recent work challenging principles of topic transparency in topic-sensitive logics has relied on providing accounts of connectives that are topic-transformative, that is, which non-trivially influence the overall topic assigned to a complex. This leads naturally to the question of what operators in natural language might also act as topic-transformative functions. This talk reviews work in progress studying “qua”, “per se”, and other topic-transformative operators. After discussing ways to analyze these operators, we will emphasize how such analyses are likely to assist in a parallel project of updating Richard Sylvan’s work on relevant containment logic.
Note: This is joint work with Pietro Vigiani (Pisa) and Jitka Kadlečková (Rensselaer).
- - - - Tuesday, Oct 22, 2024 - - - -
- - - - Wednesday, Oct 23, 2024 - - - -
- - - - Thursday, Oct 24, 2024 - - - -
- - - - Friday, Oct 25, 2024 - - - -
CUNY Graduate Center
Friday, October 25, 11:00am NY time, Room 3207
Hybrid: Please email Victoria Gitman (vgitman@gmail.com) for zoom info.
CUNY Graduate Center
Friday October 25, 2:00pm-3:30pm, Room 4419
Hans Schoutens, CUNY
Computing away negation using ancients: from existential to Diophantine sentences
Last semester, I discussed geometric methods for decidability over a complete discrete valuation ring (DVR) in equal characteristic, suggesting that these methods could be applied effectively. In this talk, I aim to clarify the computability issues surrounding this topic while at the same time shifting focus to the case of mixed characteristic. Whereas quantifier elimination (QE) results are established for p-adic numbers, the general landscape remains less explored. I will demonstrate that for any existential sentence over a computable ring, we can effectively construct a positive existential (or Diophantine) sentence which is logically equivalent to the original in every excellent Henselian DVR containing the ring. This construction hinges on Resolution of Singularities, which is feasible in characteristic zero.
Furthermore, I will utilize ultraproducts, specifically the protoproduct variant, to show how Diophantine statements over a DVR can be reduced to those over a residue ring. Since the residue ring is Artinian—and in the case of p-adics, even finite—the associated problems become significantly more manageable. However, it is important to note that this approach does not yet yield a general QE result, as it applies only to sentences, not formulas. The challenge lies in the dependence of certain effective bounds on parameters. I will provide insights into how to derive a bound based on a refined notion of complexity within the equational system—beyond simply considering its degree—using ultraproducts. Additionally, I will address a request from the audience in my last talk by demonstrating that this bound is indeed effective.
And somehow it will also require some delving into the theory of Witt vectors and ancient elements, as I will explain.- - - - Other Logic News - - - -
- - - - Web Site - - - -
Find us on the web at: nylogic.github.io
(site designed, built & maintained by Victoria Gitman)
-------- ADMINISTRIVIA --------
To subscribe/unsubscribe to this list, please email your request to jreitz@citytech.cuny.edu.
If you have a logic-related event that you would like included in future mailings, please email jreitz@citytech.cuny.edu.
Wednesday seminar
KGRC Set Theory talk October 17
Set theory and topology seminar 15.10.2024 Piotr Borodulin-Nadzieja
Piotr Borodulin-Nadzieja
(on behalf of the organizers, i.e. Piotr Borodulin-Nadzieja, Paweł Krupski, Aleksandra Kwiatkowska, Grzegorz Plebanek, Robert Rałowski and myself)
About 15 minutes before the seminar we invite you for coffee and a chat to social room.
https://settheory.pwr.edu.pl/
http://www.math.uni.wroc.pl/seminarium/topologia
Logic Seminar Wed 9 Oct 2024 17:00 hrs at NUS
Wednesday seminar
This Week in Logic at CUNY (heads up, no email next week)
Rutgers Logic Seminar
Monday September 30, 3:30pm, Rutgers University, Hill Center, Hill 705
Extremely amenable automorphism groups of countable structures
Logic and Metaphysics Workshop
Date: Monday,September 30, 4.15-6.15pm (NY time)
Room: Graduate Center Room 4419
Daniel West (CUNY)
Title: The disjunction property for operational relevance logics
Abstract: A logic has the disjunction property just in case whenever a disjunction is valid, at least one of its disjuncts is valid. The disjunction property is important to constructivists and is a well-known feature of intuitionistic logic. In this talk I present joint work with Yale Weiss in which we use model-theoretic techniques to show that the disjunction property also holds in Urquhart’s operational relevance logics. This is a known result in the case of the positive semilattice logic, but the proof is quite different, being proof-theoretic rather than semantic. These results suggest that operational relevance logics merit further attention from a constructivist perspective. Along the way, we also provide a novel proof that the disjunction property holds in intuitionistic logic.
Note: This is joint work with Yale Weiss (CUNY).
- - - - Tuesday, Oct 1, 2024 - - - -
- - - - Wednesday, Oct 2, 2024 - - - -
NO CLASSES SCHEDULED - CUNY GRADUATE CENTER
- - - - Thursday, Oct 3, 2024 - - - -
NO CLASSES SCHEDULED - CUNY GRADUATE CENTER
- - - - Friday, Oct 4, 2024 - - - -
- - - - Monday, Oct 7, 2024 - - - -
Monday October 7, 3:30pm, Rutgers University, Hill Center, Hill 705
Logic and Metaphysics Workshop
Date: Monday, October 7, 4.15-6.15pm (NY time), GC 4419
- - - - Tuesday, Oct 8, 2024 - - - -
- - - - Wednesday, Oct 9, 2024 - - - -
The New York City Category Theory Seminar
Department of Computer Science
Department of Mathematics
The Graduate Center of The City University of New York
Date and Time: Wednesday October 9, 2024, 7:00 - 8:30 PM. ZOOM TALK (contact N Yanofsky for zoom link)
Title: Exodromy.
Abstract: A favorite result of first semester algebraic topology is the “monodromy theorem,” which states that for a suitable topological space X, there is a triple equivalence between the categories of covering spaces of X, sets with an action from the fundamental group of X, and locally constant sheaves on X. This result has recently been upgraded by MacPherson and others to a stratified setting, where the underlying space may be carved into a poset of subspaces. In this talk, we’ll look at the main ingredients of the so-called “exodromy theorem,” reviewing stratified spaces and developing “constructible sheaves” and the “exit-path category” along the way.
- - - - Thursday, Oct 10, 2024 - - - -
- - - - Friday, Oct 11, 2024 - - - -
- - - - Other Logic News - - - -
- - - - Web Site - - - -
Find us on the web at: nylogic.github.io
(site designed, built & maintained by Victoria Gitman)
-------- ADMINISTRIVIA --------
To subscribe/unsubscribe to this list, please email your request to jreitz@citytech.cuny.edu.
If you have a logic-related event that you would like included in future mailings, please email jreitz@citytech.cuny.edu.
KGRC Set Theory talks September 30 - October 4
Wednesday seminar
Wednesday seminar
This Week in Logic at CUNY
Rutgers Logic Seminar
Monday September 23, 3:30pm, Rutgers University, Hill Center, Hill 705
Countable reductions in computable structure theory
Logic and Metaphysics Workshop
Date: Monday,September 23, 4.15-6.15pm (NY time)
Room: Graduate Center Room 4419
Title: Value and freedom
Abstract: In order to decide how good a society is, we need some measure of goodness. And the goodness of a society is typically obtained by somehow summing up the well beings of its members. Various approaches include Utilitarianism and Rawlsianism as well as the Leximin approach suggested by Amartya Sen. But Sen and Nussbaum have suggested that the Capability of an individual, what the individual can do, should be the real measure of well being. Another issue is that of freedom. My freedom can be diminished by some restrictive laws. But it can also be diminished by some handicap, or by certain social methods not being available. How to measure the amount of freedom I have? Is it simply the number of options I have, or does the value of the options also matter? And what is the mathematics of freedom?
Note: An extended abstract is available here.
- - - - Tuesday, Sep 24, 2024 - - - -
- - - - Wednesday, Sep 25, 2024 - - - -
The New York City Category Theory Seminar
Department of Computer Science
Department of Mathematics
The Graduate Center of The City University of New York
Date and Time: Wednesday September 25, 2024, 7:00 - 8:30 PM. IN-PERSON TALK, Room 6417
Title: A formal category theory for oo-T-multicategories.
Abstract: We will explore a framework for oo-T-multicategories. To begin, we build a schema for multicategories out of the simplex schema and the monoid schema. The multicategory schema, D_m, inherits the structure of a monad from the +1 monad on the monoid schema. Simplicial T-multicategories are monad preserving functors out of the multicategory schema, [D_m, T], into another monad T. The framework is larger than just [D_m,T]. A larger structure describes notions of yoneda lemma and fibration. Inner fibrant, simplicial T-multicategories are oo-T-multicategories. oo-T-multicategories generalize oo-categories and oo-operads: oo-operads are fm-multicategories, oo-categories are Id-multicategories.
We use this framework to study oo-fc-multicategories, or "oo - virtual double categories". In general, under various assumptions on T (which hold for fc), the collection of oo-T-multicategories [D_m, T] has other useful structure. One such structure is a join operation. This join operation points towards a synthetic definition of op/cartesian cells, which we hope will model oo-virtual equipments. If there is time, I will explain the motivation for this study as it relates to ontologies, meta-theories and type theories.
- - - - Thursday, Sep 26, 2024 - - - -
- - - - Friday, Sep 27, 2024 - - - -
CUNY Graduate Center
Friday, September 6, 11:00am NY time, Room 3207
Hybrid: Please email Victoria Gitman (vgitman@gmail.com) for zoom info.
Takashi Yamazoe, Kobe University
Cichoń's maximum with the uniformity and the covering of the -ideal generated by closed null sets
Let denote the -ideal generated by closed null sets on . We show that the uniformity and the covering of can be added to Cichoń's maximum with distinct values, more specifically, it is consistent that holds.
CUNY Graduate Center
Friday September 27, 2:00pm-3:30pm, Room 4419
Victoria Gitman, CUNY
Baby measurable cardinals
Measurable cardinals and other large cardinals on the larger side of things are characterized by the existence of elementary embeddings from the universe of sets into a transitive submodel . The clear pattern the large cardinals in that region follow is that the closer the submodel is to the stronger the large cardinal notion. Smaller large cardinals, such as weakly compact or Ramsey cardinals, are known chiefly for their combinatorial properties, such as the existence of large homogeneous sets for colorings. But, it turns out that they too have elementary embeddings characterizations with embeddings on the correspondingly small models of (a fragment) of set theory (usually , the theory with powerset axiom removed). Elementary embeddings of are often by-definable with the existence of certain ultrafilters or systems of ultrafilters. The classical example is that is measurable if and only if there is a -complete ultrafilter on . The model is then the transitive collapse of the ultrapower of by . The connection between elementary embedding and ultrafilters also exists in the case of the small elementary embeddings. A typical elementary embedding characterization of a small large cardinal follows the following template: for every , there is a (technical condition) model , with , for which there is an -ultrafilter on with (technical properties). A subset is an -ultrafilter if the structure , with a predicate for , satisfies that is a -complete ultrafilter on , meaning that measures all the sets in and its completeness applies to sequences that are elements of . The reason we need to add a predicate for is that in most interesting case, and in contrast to the situation with measurable cardinals, is not an element of (indeed in most cases, does not exist in ). While the structure usually satisfies some large fragment of , once, we add a predicate for the -ultrafilter , the structure can fail to satisfy even -separation. In this talk, I will discuss how smaller large cardinals follow the pattern that the more set theory the structure satisfies the stronger the resulting large cardinal notion. I will use these observations to introduce a new hierarchy of large cardinals between Ramsey and measurable cardinals. This is joint work with Philipp Schlicht, based on earlier work by Bovykin and McKenzie.
- - - - Monday, Sep 30, 2024 - - - -
Rutgers Logic Seminar
Monday September 30, 3:30pm, Rutgers University, Hill Center, Hill 705
Extremely amenable automorphism groups of countable structures
Logic and Metaphysics Workshop
Date: Monday,September 30, 4.15-6.15pm (NY time)
Room: Graduate Center Room 4419
Daniel West (CUNY)
Title: The disjunction property for operational relevance logics
Abstract: A logic has the disjunction property just in case whenever a disjunction is valid, at least one of its disjuncts is valid. The disjunction property is important to constructivists and is a well-known feature of intuitionistic logic. In this talk I present joint work with Yale Weiss in which we use model-theoretic techniques to show that the disjunction property also holds in Urquhart’s operational relevance logics. This is a known result in the case of the positive semilattice logic, but the proof is quite different, being proof-theoretic rather than semantic. These results suggest that operational relevance logics merit further attention from a constructivist perspective. Along the way, we also provide a novel proof that the disjunction property holds in intuitionistic logic.
Note: This is joint work with Yale Weiss (CUNY).
- - - - Tuesday, Oct 1, 2024 - - - -
- - - - Wednesday, Oct 2, 2024 - - - -
NO CLASSES SCHEDULED - CUNY GRADUATE CENTER
- - - - Thursday, Oct 3, 2024 - - - -
NO CLASSES SCHEDULED - CUNY GRADUATE CENTER
- - - - Friday, Oct 4, 2024 - - - -
- - - - Other Logic News - - - -
- - - - Web Site - - - -
Find us on the web at: nylogic.github.io
(site designed, built & maintained by Victoria Gitman)
-------- ADMINISTRIVIA --------
To subscribe/unsubscribe to this list, please email your request to jreitz@citytech.cuny.edu.
If you have a logic-related event that you would like included in future mailings, please email jreitz@citytech.cuny.edu.
This Week in Logic at CUNY
Rutgers Logic Seminar
Monday September 16, 3:30pm, Rutgers University, Hill Center, Hill 705
Maxwell Levine, University of Freiburg
Namba Forcing, Minimality, and Approximations
Logic and Metaphysics Workshop
Date: Monday,September 16, 4.15-6.15pm (NY time)
Room: Graduate Center Room 4419
Speaker: Mel Fitting (CUNY)
Title: Simple tableaus for simple logics
Abstract: Consider those many-valued logic models in which the truth values are a lattice that supplies interpretations for the logical connectives of conjunction and disjunction, and which has a De Morgan involution supplying an interpretation for negation. Assume the set of designated truth values is a prime filter in the lattice. Each of these structures determines a simple many-valued logic. We show there is a single Smullyan style signed tableau system appropriate for all of the logics these structures determine. Differences between the logics are confined entirely to tableau branch closure rules. Completeness, soundness, and interpolation can be proved in a uniform way for all cases. Since branch closure rules have a limited number of variations, in fact all the semantic structures determine just four different logics, all well-known ones. Asymmetric logics such as strict/tolerant, ST, also share all the same tableau rules, but differ in what constitutes an initial tableau. It is also possible to capture the notion of anti-validity using the same set of tableau rules. Thus a simple set of tableau rules serves as a unifying and classifying device for a natural and simple family of many-valued logics.
- - - - Tuesday, Sep 17, 2024 - - - -
- - - - Wednesday, Sep 18, 2024 - - - -
The New York City Category Theory Seminar
Department of Computer Science
Department of Mathematics
The Graduate Center of The City University of New York
Date and Time: Wednesday September 18, 2024, 7:00 - 8:30 PM. IN-PERSON TALK, Room 6417
- - - - Friday, Sep 20, 2024 - - - -
- - - - Monday, Sep 23, 2024 - - - -
Rutgers Logic Seminar
Monday September 9, 3:30pm, Rutgers University, Hill Center, Hill 705
Countable reductions in computable structure theory
Logic and Metaphysics Workshop
Date: Monday,September 23, 4.15-6.15pm (NY time)
Room: Graduate Center Room 4419
Title: Value and freedom
Abstract: In order to decide how good a society is, we need some measure of goodness. And the goodness of a society is typically obtained by somehow summing up the well beings of its members. Various approaches include Utilitarianism and Rawlsianism as well as the Leximin approach suggested by Amartya Sen. But Sen and Nussbaum have suggested that the Capability of an individual, what the individual can do, should be the real measure of well being. Another issue is that of freedom. My freedom can be diminished by some restrictive laws. But it can also be diminished by some handicap, or by certain social methods not being available. How to measure the amount of freedom I have? Is it simply the number of options I have, or does the value of the options also matter? And what is the mathematics of freedom?
Note: An extended abstract is available here.
- - - - Tuesday, Sep 24, 2024 - - - -
- - - - Wednesday, Sep 25, 2024 - - - -
The New York City Category Theory Seminar
Department of Computer Science
Department of Mathematics
The Graduate Center of The City University of New York
Date and Time: Wednesday September 25, 2024, 7:00 - 8:30 PM. IN-PERSON TALK, Room 6417
Title: A formal category theory for oo-T-multicategories.
Abstract: We will explore a framework for oo-T-multicategories. To begin, we build a schema for multicategories out of the simplex schema and the monoid schema. The multicategory schema, D_m, inherits the structure of a monad from the +1 monad on the monoid schema. Simplicial T-multicategories are monad preserving functors out of the multicategory schema, [D_m, T], into another monad T. The framework is larger than just [D_m,T]. A larger structure describes notions of yoneda lemma and fibration. Inner fibrant, simplicial T-multicategories are oo-T-multicategories. oo-T-multicategories generalize oo-categories and oo-operads: oo-operads are fm-multicategories, oo-categories are Id-multicategories.
We use this framework to study oo-fc-multicategories, or "oo - virtual double categories". In general, under various assumptions on T (which hold for fc), the collection of oo-T-multicategories [D_m, T] has other useful structure. One such structure is a join operation. This join operation points towards a synthetic definition of op/cartesian cells, which we hope will model oo-virtual equipments. If there is time, I will explain the motivation for this study as it relates to ontologies, meta-theories and type theories.
- - - - Thursday, Sep 26, 2024 - - - -
- - - - Friday, Sep 27, 2024 - - - -
CUNY Graduate Center
Friday September 27, 2:00pm-3:30pm, Room 4419
- - - - Other Logic News - - - -
- - - - Web Site - - - -
Find us on the web at: nylogic.github.io
(site designed, built & maintained by Victoria Gitman)
-------- ADMINISTRIVIA --------
To subscribe/unsubscribe to this list, please email your request to jreitz@citytech.cuny.edu.
If you have a logic-related event that you would like included in future mailings, please email jreitz@citytech.cuny.edu.
Logic Seminar 18 September 2024 16:45 hrs at NUS by Le Quy Thuong
This Week in Logic at CUNY
- - - - Monday, Sep 9, 2024 - - - -
Rutgers Logic Seminar
Monday September 9, 3:30pm Hill Center, Hill 705
Corey Switzer, KGRC
Weak and Strong Variants of Baumgartner's Axiom for Polish Spaces
Date: Monday,September 9, 4.15-6.15pm (NY time)
Room: Graduate Center Room 4419
Speaker: Hartry Field (NYU)
Title: Well-behaved truth
Abstract: Common-sense reasoning with truth involves both the use of classical logic and the assumption of the transparency of truth (the equivalence between a sentence and the attribution of truth to it). The semantic paradoxes show that at least one of these must go, and different theorists make different choices. But whatever one’s choice, it’s valuable to carve out one or more domains where both classical logic and transparency can be assumed; domains where everything is *well-behaved*. In this talk I’ll explore a method of adding a predicate of well-behavedness to various truth theories, which works for both classical and nonclassical theories (including non-classical theories with special conditionals). With such a predicate, one can reason more easily, and formulate and prove generalizations that are unavailable without such a predicate. Besides their intrinsic interest, these generalizations greatly increase the proof-theoretic strength of axiomatic theories. (There are some previous proposals for adding a well-behavedness predicate to specific classical theories, and others for adding one to non-classical theories without special conditionals. The current proposal, besides being general, is also more satisfactory in the individual cases, and is the only one I know of for non-classical theories with conditionals.)
- - - - Tuesday, Sep 10, 2024 - - - -
- - - - Wednesday, Sep 11, 2024 - - - -
- - - - Thursday, Sep 12, 2024 - - - -
- - - - Friday, Sep 13, 2024 - - - -
CUNY Graduate Center
Friday September 13, 2:00pm-3:30pm, Room 4419
David Marker, University of Illinois at Chicago
Rigid real closed fields
Shelah showed that it is consistent that there are uncountable rigid non-archimedean real closed fields and, later, he and Mekler proved this in . Answering a question of Enayat, Charlie Steinhorn and I show that there are countable rigid non-archimedean real closed fields by constructing one of transcendence degree two.
- - - - Monday, Sep 16, 2024 - - - -
Rutgers Logic Seminar
Monday September 9, 3:30pm, Rutgers University, Hill Center, Hill 705
Maxwell Levine, University of Freiburg
Namba Forcing, Minimality, and Approximations
Logic and Metaphysics Workshop
Date: Monday,September 16, 4.15-6.15pm (NY time)
Room: Graduate Center Room 4419
Speaker: Mel Fitting (CUNY)
Title: Simple tableaus for simple logics
Abstract: Consider those many-valued logic models in which the truth values are a lattice that supplies interpretations for the logical connectives of conjunction and disjunction, and which has a De Morgan involution supplying an interpretation for negation. Assume the set of designated truth values is a prime filter in the lattice. Each of these structures determines a simple many-valued logic. We show there is a single Smullyan style signed tableau system appropriate for all of the logics these structures determine. Differences between the logics are confined entirely to tableau branch closure rules. Completeness, soundness, and interpolation can be proved in a uniform way for all cases. Since branch closure rules have a limited number of variations, in fact all the semantic structures determine just four different logics, all well-known ones. Asymmetric logics such as strict/tolerant, ST, also share all the same tableau rules, but differ in what constitutes an initial tableau. It is also possible to capture the notion of anti-validity using the same set of tableau rules. Thus a simple set of tableau rules serves as a unifying and classifying device for a natural and simple family of many-valued logics.
- - - - Tuesday, Sep 17, 2024 - - - -
- - - - Wednesday, Sep 18, 2024 - - - -
The New York City Category Theory Seminar
Department of Computer Science
Department of Mathematics
The Graduate Center of The City University of New York
Date and Time: Wednesday September 18, 2024, 7:00 - 8:30 PM. IN-PERSON TALK
Room 5417 (not the usual Room 6417)
- - - - Friday, Sep 20, 2024 - - - -
- - - - Other Logic News - - - -
- - - - Web Site - - - -
Find us on the web at: nylogic.github.io
(site designed, built & maintained by Victoria Gitman)
-------- ADMINISTRIVIA --------
To subscribe/unsubscribe to this list, please email your request to jreitz@citytech.cuny.edu.
If you have a logic-related event that you would like included in future mailings, please email jreitz@citytech.cuny.edu.
UPDATE: This Week in Logic - today's Logic Workshop is in GC 4419
- - - - Thursday, Sep 05, 2024 - - - -
- - - - Friday, Sep 06, 2024 - - - -
Set Theory Seminar
CUNY Graduate Center
Friday, September 6, 11:00am NY time
Virtual: Please email Victoria Gitman (vgitman@gmail.com) for zoom info.
Corey Switzer, Kurt Gödel Research Center
Reflecting Ordinals and Forcing
Let and either or . An ordinal is called -reflecting if for each and each -formula if then there is a so that where here refers to full second order logic. The least -reflecting ordinal is called and the least -ordinal is called . These ordinals provably exist and are countable (for all ). They arise naturally in proof theory, particularly in calibrating consistency strength of strong arithmetics and weak set theories. Moreover, surprisingly, their relation to one another relies heavily on the background set theory. If then for all we have (due to Cutland) while under PD for all we have if and only if is even (due to Kechris).
Surprisingly nothing was known about these ordinals in any model which satisfies neither nor PD. In this talk I will sketch some recent results which aim at rectifying this. In particular we will show that in any generic extension by any number of Cohen or Random reals, a Sacks, Miller or Laver real, or any lightface, weakly homogeneous Borel ccc forcing notion agrees with about which ordinals are -reflecting (for any and ). Meanwhile, in the generic extension by collapsing many interesting things happen, not least amongst them that and are increased - yet still below for . Along the way we will discuss the plethora of open problems in this area. This is joint work with Juan Aguilera.
CUNY Graduate Center
Friday September 6, 2:00pm-3:30pm, Room 4419
Corey Switzer, Kurt Gödel Research Center
Weak and Strong Variants of Baumgartner's Axiom for Polish Spaces
(One version of) Cantor's second best theorem states that every pair of countable, dense sets of reals are isomorphic as linear orders. From the perspective of set theory it's natural to ask whether some variant of this theorem can hold consistently when 'countable' is replaced by 'uncountable'. This was shown in the affirmative by Baumgartner in 1973 who showed the consistency of 'all -dense sets of reals are order isomorphic' where a set is -dense for a cardinal if its intersection with any open interval has size . The above became known as Baumgartner's axiom, denoted BA, and is an important axiom in both combinatorial set theory and set theoretic topology. BA has natural higher dimensional analogues - i.e., statements with the same relation to that BA has to . It is a long standing open conjecture of Steprāns and Watson that BA implies its higher dimensional analogues.
In the talk I will describe some attempts to break the ice on this open problem mostly by looking at a family of weaker and stronger variants of BA and investigating their combinatorial, analytic and topological consequences. We will show that while some weak variants of BA have all the same consequences as BA, even weaker ones do not. Meanwhile a strengthening of BA for Baire and Polish space gives much more information.
Next Week in Logic at CUNY:
- - - - Monday, Sep 9, 2024 - - - -
Rutgers Logic Seminar
Monday September 9, 3:30pm Hill Center, Hill 705
Corey Switzer, KGRC
Weak and Strong Variants of Baumgartner's Axiom for Polish Spaces
Date: Monday,September 9, 4.15-6.15pm (NY time)
Room: Graduate Center Room 4419
Speaker: Hartry Field (NYU)
Title: Well-behaved truth
Abstract: Common-sense reasoning with truth involves both the use of classical logic and the assumption of the transparency of truth (the equivalence between a sentence and the attribution of truth to it). The semantic paradoxes show that at least one of these must go, and different theorists make different choices. But whatever one’s choice, it’s valuable to carve out one or more domains where both classical logic and transparency can be assumed; domains where everything is *well-behaved*. In this talk I’ll explore a method of adding a predicate of well-behavedness to various truth theories, which works for both classical and nonclassical theories (including non-classical theories with special conditionals). With such a predicate, one can reason more easily, and formulate and prove generalizations that are unavailable without such a predicate. Besides their intrinsic interest, these generalizations greatly increase the proof-theoretic strength of axiomatic theories. (There are some previous proposals for adding a well-behavedness predicate to specific classical theories, and others for adding one to non-classical theories without special conditionals. The current proposal, besides being general, is also more satisfactory in the individual cases, and is the only one I know of for non-classical theories with conditionals.)
- - - - Tuesday, Sep 10, 2024 - - - -
- - - - Wednesday, Sep 11, 2024 - - - -
- - - - Thursday, Sep 12, 2024 - - - -
- - - - Friday, Sep 13, 2024 - - - -
CUNY Graduate Center
Friday September 13, 2:00pm-3:30pm, Room 4419
David Marker, University of Illinois at Chicago
Rigid real closed fields
Shelah showed that it is consistent that there are uncountable rigid non-archimedean real closed fields and, later, he and Mekler proved this in . Answering a question of Enayat, Charlie Steinhorn and I show that there are countable rigid non-archimedean real closed fields by constructing one of transcendence degree two.
- - - - Other Logic News - - - -
- - - - Web Site - - - -
Find us on the web at: nylogic.github.io
(site designed, built & maintained by Victoria Gitman)
-------- ADMINISTRIVIA --------
To subscribe/unsubscribe to this list, please email your request to jreitz@citytech.cuny.edu.
If you have a logic-related event that you would like included in future mailings, please email jreitz@citytech.cuny.edu.
Logic Seminar 11 September 2024 17:00 hrs by Kihara Takayuki at NUS
Wednesday seminar
This Week in Logic at CUNY
- - - - Thursday, Sep 05, 2024 - - - -
- - - - Friday, Sep 06, 2024 - - - -
Set Theory Seminar
CUNY Graduate Center
Friday, September 6, 11:00am NY time
Virtual: Please email Victoria Gitman (vgitman@gmail.com) for zoom info.
Corey Switzer, Kurt Gödel Research Center
Reflecting Ordinals and Forcing
Let and either or . An ordinal is called -reflecting if for each and each -formula if then there is a so that where here refers to full second order logic. The least -reflecting ordinal is called and the least -ordinal is called . These ordinals provably exist and are countable (for all ). They arise naturally in proof theory, particularly in calibrating consistency strength of strong arithmetics and weak set theories. Moreover, surprisingly, their relation to one another relies heavily on the background set theory. If then for all we have (due to Cutland) while under PD for all we have if and only if is even (due to Kechris).
Surprisingly nothing was known about these ordinals in any model which satisfies neither nor PD. In this talk I will sketch some recent results which aim at rectifying this. In particular we will show that in any generic extension by any number of Cohen or Random reals, a Sacks, Miller or Laver real, or any lightface, weakly homogeneous Borel ccc forcing notion agrees with about which ordinals are -reflecting (for any and ). Meanwhile, in the generic extension by collapsing many interesting things happen, not least amongst them that and are increased - yet still below for . Along the way we will discuss the plethora of open problems in this area. This is joint work with Juan Aguilera.
CUNY Graduate Center
Friday September 6, 2:00pm-3:30pm, Room 6417 (NOTICE THE CHANGE! BACK TO OUR PRE-2023 ROOM)
Corey Switzer, Kurt Gödel Research Center
Weak and Strong Variants of Baumgartner's Axiom for Polish Spaces
(One version of) Cantor's second best theorem states that every pair of countable, dense sets of reals are isomorphic as linear orders. From the perspective of set theory it's natural to ask whether some variant of this theorem can hold consistently when 'countable' is replaced by 'uncountable'. This was shown in the affirmative by Baumgartner in 1973 who showed the consistency of 'all -dense sets of reals are order isomorphic' where a set is -dense for a cardinal if its intersection with any open interval has size . The above became known as Baumgartner's axiom, denoted BA, and is an important axiom in both combinatorial set theory and set theoretic topology. BA has natural higher dimensional analogues - i.e., statements with the same relation to that BA has to . It is a long standing open conjecture of Steprāns and Watson that BA implies its higher dimensional analogues.
In the talk I will describe some attempts to break the ice on this open problem mostly by looking at a family of weaker and stronger variants of BA and investigating their combinatorial, analytic and topological consequences. We will show that while some weak variants of BA have all the same consequences as BA, even weaker ones do not. Meanwhile a strengthening of BA for Baire and Polish space gives much more information.
Next Week in Logic at CUNY:
- - - - Monday, Sep 9, 2024 - - - -
Rutgers Logic Seminar
Monday September 9, 3:30pm Hill Center, Hill 705
Corey Switzer, KGRC
Weak and Strong Variants of Baumgartner's Axiom for Polish Spaces
Date: Monday,September 9, 4.15-6.15pm (NY time)
Room: Graduate Center Room 4419
Speaker: Hartry Field (NYU)
Title: Well-behaved truth
Abstract: Common-sense reasoning with truth involves both the use of classical logic and the assumption of the transparency of truth (the equivalence between a sentence and the attribution of truth to it). The semantic paradoxes show that at least one of these must go, and different theorists make different choices. But whatever one’s choice, it’s valuable to carve out one or more domains where both classical logic and transparency can be assumed; domains where everything is *well-behaved*. In this talk I’ll explore a method of adding a predicate of well-behavedness to various truth theories, which works for both classical and nonclassical theories (including non-classical theories with special conditionals). With such a predicate, one can reason more easily, and formulate and prove generalizations that are unavailable without such a predicate. Besides their intrinsic interest, these generalizations greatly increase the proof-theoretic strength of axiomatic theories. (There are some previous proposals for adding a well-behavedness predicate to specific classical theories, and others for adding one to non-classical theories without special conditionals. The current proposal, besides being general, is also more satisfactory in the individual cases, and is the only one I know of for non-classical theories with conditionals.)
- - - - Tuesday, Sep 10, 2024 - - - -
- - - - Wednesday, Sep 11, 2024 - - - -
- - - - Thursday, Sep 12, 2024 - - - -
- - - - Friday, Sep 13, 2024 - - - -
CUNY Graduate Center
Friday September 13, 2:00pm-3:30pm, Room 6417 (NOTICE THE CHANGE! BACK TO OUR PRE-2023 ROOM)
David Marker, University of Illinois at Chicago
Rigid real closed fields
Shelah showed that it is consistent that there are uncountable rigid non-archimedean real closed fields and, later, he and Mekler proved this in . Answering a question of Enayat, Charlie Steinhorn and I show that there are countable rigid non-archimedean real closed fields by constructing one of transcendence degree two.
- - - - Other Logic News - - - -
- - - - Web Site - - - -
Find us on the web at: nylogic.github.io
(site designed, built & maintained by Victoria Gitman)
-------- ADMINISTRIVIA --------
To subscribe/unsubscribe to this list, please email your request to jreitz@citytech.cuny.edu.
If you have a logic-related event that you would like included in future mailings, please email jreitz@citytech.cuny.edu.
Location change -- Wednesday seminar -- Macpherson
Wednesday seminar -- Macpherson
Logic Seminar 28 August 2024 17:00 hrs by Linus Richter, NUS
Logic Seminar at NUS on 21 Aug 2024 17:00 hrs by Vo Ngoc Thieu
KGRC talk August 16
Logic Seminar 7 August 2024 17:00 hrs at NUS by Zhang Jing
Logic Seminar 31 July 2024 17:00 hrs at NUS by George Barmpalias, CAS
Kyoto University RIMS Set Theory Workshop, October 9-11, 2024
Wednesday seminar
Set theory and topology seminar 25.06.2024 everybody
I am happy to announce that the last seminar this semester in Set Theory and Topology (on Thuesday 25.06.2024 at 17:15) will take place in
"Forma Płynna Beach Bar"
Plaża miejska, Wybrzeże Wyspiańskiego.
Every participant is the speaker.
(on behalf of the organizers, i.e. Piotr Borodulin-Nadzieja, Paweł Krupski, Aleksandra Kwiatkowska, Grzegorz Plebanek, Robert Rałowski and myself)
Wednesday seminar
Set theory and topology seminar 18.06.2024 Aleksander Cieślak
Aleksander Cieślak
(on behalf of the organizers, i.e. Piotr Borodulin-Nadzieja, Paweł Krupski, Aleksandra Kwiatkowska, Grzegorz Plebanek, Robert Rałowski and myself)
About 15 minutes before the seminar we invite you for coffee and a chat to social room A.4.1.A in C-19.
https://settheory.pwr.edu.pl/
http://www.math.uni.wroc.pl/seminarium/topologia
Wednesday seminar
KGRC talk June 20
56th Nankai Logic Colloquium
Hello everyone,
This week our weekly Nankai Logic Colloquium will be in the afternoon.
Our speaker this week will be Lionel Nguyen Van The from Aix-Marseille University. This talk will take place this Friday, June 14th, from 4pm to 5pm (UTC+8, Beijing time).
Abstract:
Structural Ramsey theory appeared naturally as a branch of Ramsey theory in the seventies, and is concerned with partition properties of combinatorial objects that are equipped with some structure (typically, in the sense of first order logic). While several seminal results were proved in those years, the subject was offered an unexpected revival thirty years later, whose consequences are still being felt today. This talk will be an attempt to describe the main lines of thought behind this story, starting from the pioneering work of Graham, Leeb, Nesetril, Rödl, Rothschild, Spencer and Voigt, continuing with that of Kechris, Pestov and Todorcevic, and finishing with that of Dobrinen.
This is going to be an online event. Follow the link below to join the Zoom meeting. Please use your real name to join the meeting.
Best wishes,
Ming Xiao
Set theory and topology seminar 11.06.2024 Jadwiga Świerczyńska
Jadwiga Świerczyńska
(on behalf of the organizers, i.e. Piotr Borodulin-Nadzieja, Paweł Krupski, Aleksandra Kwiatkowska, Grzegorz Plebanek, Robert Rałowski and myself)
About 15 minutes before the seminar we invite you for coffee and a chat to social room A.4.1.A in C-19.
https://settheory.pwr.edu.pl/
http://www.math.uni.wroc.pl/seminarium/topologia
KGRC talks June 11 -13
55th Nankai Logic Colloquium
Hello everyone,
This week our weekly Nankai Logic Colloquium will be in the afternoon.
Our speaker this week will be Rizos Sklinos from the Chinese Academy of Sciences. This talk will take place this Friday, June 7th, from 4pm to 5pm (UTC+8, Beijing time).
This is going to be an online/offline hybrid event. Follow the link below to join the Zoom meeting. Please use your real name to join the meeting.
Time :16:00pm, Jun. 7, 2024(Beijing Time)
Zoom Number : 436 658 8683
Passcode :477893
Best wishes,
Ming Xiao
Wednesday seminar
Cross-Alps Logic Seminar (speaker: Lorenz Halbeisen)
The Cross-Alps Logic Seminar is co-organized by the logic groups of Genoa, Lausanne, Turin and Udine as part of our collaboration in the project PRIN 2022 'Models, Sets and Classifications'.
All the best,
Vincenzo
Wednesday seminar
Set theory and topology seminar 4.06.2024 Andres Uribe-Zapata (TU Wien)
Andres Uribe-Zapata (TU Wien)
In this talk, we present an integration theory with respect to finitely additive measures on a field of sets $\mathcal{B} \subseteq \mathcal(X)$ for some non-empty set $X$. For this, we start by reviewing some fundamental properties of finitely additive measures on Boolean algebras. Later, we present a definition of the integral in this context and some basic properties of the integral and the integrability. We also study integration over subsets of $X$ to introduce the Jordan algebra and compare the integration on this new algebra with the integration on $\mathcal{B}$. Finally, we say that a finitely additive measure on $\mathcal{B}$ is \emph{free} if $\mathcal{B}$ contains any finite subset of $X$ and its measure is zero. We close the talk by providing some characterizations of free finitely additive measures.
This is a joint work with Miguel A. Cardona and Diego A. Mejía.
References:
[CMU] Miguel A. Cardona, Diego A. Mejía and Andrés F. Uribe-Zapata. Finitely additive measures on Boolean algebras. In Preparation.
[UZ23] Andrés Uribe-Zapata. Iterated forcing with finitely additive measures: applications of probability to forcing theory. Master’s thesis, Universidad Nacional de Colombia, sede Medellín, 2023. https://shorturl.at/sHY59.
(on behalf of the organizers, i.e. Piotr Borodulin-Nadzieja, Paweł Krupski, Aleksandra Kwiatkowska, Grzegorz Plebanek, Robert Rałowski and myself)
About 15 minutes before the seminar we invite you for coffee and a chat to social room A.4.1.A in C-19.
https://settheory.pwr.edu.pl/
http://www.math.uni.wroc.pl/seminarium/topologia
KGRC Talk - June 6
54th Nankai Logic Colloquium
Hello everyone,
This week our weekly Nankai Logic Colloquium is going to be in the afternoon.
Our speaker this week will be Andre Nies from the University of Auckland. This talk is going to take place this Friday, May 31, from 4pm to 5pm (UTC+8, Beijing time).
This is going to be an online event. Follow the link below to join the Zoom meeting. Please use your real name to join the meeting.
Title :The 54th Nankai Logic Colloquium-- Andre Nies
Time :16:00pm, May. 31, 2024(Beijing Time)
Zoom Number : 436 658 8683
Passcode :477893
Link :https://frontai-hk.zoom.us/j/4366588683?pwd=ob0TsLuLeIl0JT7403RaqvFKgOnuRf.1&omn=82728819387
_____________________________________________________________________
Best wishes,
Ming Xiao
Cross-Alps Logic Seminar (speaker: Mirna Džamonja)
The Cross-Alps Logic Seminar is co-organized by the logic groups of Genoa, Lausanne, Turin and Udine as part of our collaboration in the project PRIN 2022 'Models, Sets and Classifications'.
All the best,
Vincenzo
Wednesday seminar
This Week in Logic at CUNY
- - - - Tuesday, May 21, 2024 - - - -
- - - - Wednesday, May 22, 2024 - - - -
The New York City Category Theory Seminar
Department of Computer Science
Department of Mathematics
The Graduate Center of The City University of New York
URL: http://www.sci.brooklyn.cuny.edu/~noson/Seminar/index.html
Speaker: Emilio Minichiello , The CUNY Graduate Center.
Date and Time: Wednesday May 22, 2024, 7:00 - 8:30 PM. IN PERSON TALK!
Title: Presenting Profunctors.
Abstract: In categorical database theory, profunctors are ubiquitous. For example, they are used to define schemas in the algebraic data model. However, they can also be used to query and migrate data. In this talk, we will discuss an interesting phenomenon that arises when trying to model profunctors in a computer. We will introduce two notions of profunctor presentations: the UnCurried and Curried presentations. They are modeled on thinking of profunctors as functors P: C^op x D -> Set and as functors P: C^op -> Set^D, respectively. Semantically of course, these are equivalent, but their syntactic properties are quite different. The UnCurried presentations are more intuitive and easier to work with, but they carry a fatal flaw: there does not exist a semantics-preserving composition operation of UnCurried presentations that also preserves finiteness. Therefore we introduce the Curried presentations and show that they remedy this flaw. In the process, we characterize which UnCurried Presentations can be made Curried, and discuss some applications. This talk will be based off of this recent preprint which is joint work with Gabriel Goren Roig and Joshua Meyers.
- - - - Friday, May 24, 2024 - - - -
- - - - Monday, May 27, 2024 - - - -
- - - - Tuesday, May 28, 2024 - - - -
- - - - Wednesday, May 29, 2024 - - - -
- - - - Thursday, May 30, 2024 - - - -
- - - - Friday, May 31, 2024 - - - -
Find us on the web at: nylogic.github.io
(site designed, built & maintained by Victoria Gitman)
-------- ADMINISTRIVIA --------
To subscribe/unsubscribe to this list, please email your request to jreitz@citytech.cuny.edu.
If you have a logic-related event that you would like included in future mailings, please email jreitz@citytech.cuny.edu.
KGRC Talks - May 24
Wednesday seminar
53rd Nankai Logic Colloquium
Hello everyone,
This week our weekly Nankai Logic Colloquium is going to be in the afternoon, but at an irregular time, as we have two speakers this week.
_____________________________________________________________________
The records of past talks can be accessed at https://space.bilibili.com/253421893.
Best wishes,
Ming Xiao
UPDATE: This Week in Logic at CUNY
Hi everyone,
- - - - Tuesday, May 14, 2024 - - - -
Tuesday, May 14, Time 2:00 - 4:00 PM (EDT)
zoom link: ask Sergei Artemov sartemov@gmail.com
Abstract: All my working life as a logician epistemic logic came with Kripke models, in particular the kind for multiple agents with equivalence relations to interpret knowledge. Sure enough, I knew about enriched Kripke models, like subset spaces, or with topologies. But at some level of abstraction you get back your standard Kripke model. Imagine my surprise, around 2018, that there is an entirely dual sort of structure on which the epistemic logical language can be interpreted and that results in the same S5 logic: simplicial complexes. Instead of points that are worlds and links labeled with agents, we now have points that are agents and links labeled with worlds. Or, instead of edges (links), triangles, tetrahedrons, etcetera, that represent worlds. Simplicial complexes are well-known within combinatorial topology and have wide usage in distributed systems to model (a)synchronous computation. The link with epistemic modal logic is recent, spreading out from Mexico City and Paris to other parts of the world, like Vienna and Bern. Other logics are relevant too, for example KB4, in order to encode crashed processes/agents. Other epistemics are relevant too, and in particular distributed knowledge, which facilitates further generalizations from simplicial complexes to simplicial sets. It will be my pleasure to present my infatuation with this novel development connecting epistemic logic and distributed computing. Suggested introductory reading is:
https://arxiv.org/abs/2002.08863
https://link.springer.com/chapter/10.1007/978-3-030-75267-5_1
Knowledge and Simplicial Complexes
Hans van Ditmarsch, Eric Goubault, Jeremy Ledent, Sergio Rajsbaum
https://drops.dagstuhl.de/entities/document/10.4230/DagRep.13.7.34
Epistemic and Topological Reasoning in Distributed Systems (Dagstuhl Seminar 23272)
Armando Castañeda, Hans van Ditmarsch, Roman Kuznets, Yoram Moses, Ulrich Schmid
Section 4.3 Representing Epistemic Attitudes via Simplicial Complexes
- - - - Wednesday, May 15, 2024 - - - -
The New York City Category Theory Seminar
Department of Computer Science
Department of Mathematics
The Graduate Center of The City University of New York
URL: http://www.sci.brooklyn.cuny.edu/~noson/Seminar/index.html
Speaker: Raymond Puzio.
Date and Time: Wednesday May 15, 2024, 7:00 - 8:30 PM. IN-PERSON!
Title: Uniqueness of Classical Retrodiction.
Abstract: In previous talks at this Category seminar and at the Topology, Geometry and Physics seminar, Arthur Parzygnat showed how Bayesian inversion and its generalization to quantum mechanics may be interpreted as a functor on a suitable category of states which satisfies certain axioms. Such a functor is called a retrodiction and Parzygnat and collaborators conjectured that retrodiction is unique. In this talk, I will present a proof of this conjecture for the special case of classical probability theory on finite state spaces.
In this special case, the category in question has non-degenerate probability distributions on finite sets as its objects and stochastic matrices as its morphisms. After preliminary definitions and lemmas, the proof proceeds in three main steps.
In the first step, we focus on certain groups of automorphisms of certain objects. As a consequence of the axioms, it follows that these groups are preserved under any retrodiction functor and that the restriction of the functor to such a group is a certain kind of group automorphism. Since this group is isomorphic to a Lie group, it is easy to prove that the restriction of a retrodiction to such a group must equal Bayesian inversion if we assume continuity. If we do not make that assumption, we need to work harder and derive continuity "from scratch" starting from the positivity condition in the definition of stochastic matrix.
In the second step, we broaden our attention to the full automorphism groups of objects of our category corresponding to uniform distributions. We show that these groups are generated by the union of the subgroup consisting of permutation matrices and the subgroup considered in the first step. From this fact, it follows that the restriction of a retrodiction to this larger group must equal Bayesian inversion.
In the third step, we finally consider all the objects and morphisms of our category. As a consequence of what we have shown in the first two steps and some preliminary lemmas, it follows that retrodiction is given by matrix conjugation. Furthermore, Bayesian inversion is the special case where the conjugating matrices are diagonal matrices. Because the hom sets of our category are convex polytopes and a retrodiction functor is a continuous bijection of such sets, a retodiction must map polytope faces to faces. By an algebraic argument, this fact implies that the conjugating matrices are diagonal, answering the conjecture in the affirmative.
Paper.
- - - - Thursday, May 16, 2024 - - - -
*** FINAL EXAMS WEEK BEGINS - CUNY GRADUATE CENTER ***
- - - - Friday, May 17, 2024 - - - -
- - - - Monday, May 20, 2024 - - - -
- - - - Tuesday, May 21, 2024 - - - -
- - - - Wednesday, May 22, 2024 - - - -
The New York City Category Theory Seminar
Department of Computer Science
Department of Mathematics
The Graduate Center of The City University of New York
URL: http://www.sci.brooklyn.cuny.edu/~noson/Seminar/index.html
Speaker: Emilio Minichiello , The CUNY Graduate Center.
Date and Time: Wednesday May 22, 2024, 7:00 - 8:30 PM. IN PERSON TALK!
Title: Presenting Profunctors.
Abstract: In categorical database theory, profunctors are ubiquitous. For example, they are used to define schemas in the algebraic data model. However, they can also be used to query and migrate data. In this talk, we will discuss an interesting phenomenon that arises when trying to model profunctors in a computer. We will introduce two notions of profunctor presentations: the UnCurried and Curried presentations. They are modeled on thinking of profunctors as functors P: C^op x D -> Set and as functors P: C^op -> Set^D, respectively. Semantically of course, these are equivalent, but their syntactic properties are quite different. The UnCurried presentations are more intuitive and easier to work with, but they carry a fatal flaw: there does not exist a semantics-preserving composition operation of UnCurried presentations that also preserves finiteness. Therefore we introduce the Curried presentations and show that they remedy this flaw. In the process, we characterize which UnCurried Presentations can be made Curried, and discuss some applications. This talk will be based off of this recent preprint which is joint work with Gabriel Goren Roig and Joshua Meyers.
- - - - Friday, May 24, 2024 - - - -
Find us on the web at: nylogic.github.io
(site designed, built & maintained by Victoria Gitman)
-------- ADMINISTRIVIA --------
To subscribe/unsubscribe to this list, please email your request to jreitz@citytech.cuny.edu.
If you have a logic-related event that you would like included in future mailings, please email jreitz@citytech.cuny.edu.
This Week in Logic at CUNY
- - - - Tuesday, May 14, 2024 - - - -
Tuesday, May 14, Time 2:00 - 4:00 PM (EDT)
zoom link: ask Sergei Artemov sartemov@gmail.com
Abstract: All my working life as a logician epistemic logic came with Kripke models, in particular the kind for multiple agents with equivalence relations to interpret knowledge. Sure enough, I knew about enriched Kripke models, like subset spaces, or with topologies. But at some level of abstraction you get back your standard Kripke model. Imagine my surprise, around 2018, that there is an entirely dual sort of structure on which the epistemic logical language can be interpreted and that results in the same S5 logic: simplicial complexes. Instead of points that are worlds and links labeled with agents, we now have points that are agents and links labeled with worlds. Or, instead of edges (links), triangles, tetrahedrons, etcetera, that represent worlds. Simplicial complexes are well-known within combinatorial topology and have wide usage in distributed systems to model (a)synchronous computation. The link with epistemic modal logic is recent, spreading out from Mexico City and Paris to other parts of the world, like Vienna and Bern. Other logics are relevant too, for example KB4, in order to encode crashed processes/agents. Other epistemics are relevant too, and in particular distributed knowledge, which facilitates further generalizations from simplicial complexes to simplicial sets. It will be my pleasure to present my infatuation with this novel development connecting epistemic logic and distributed computing. Suggested introductory reading is:
https://arxiv.org/abs/2002.08863
https://link.springer.com/chapter/10.1007/978-3-030-75267-5_1
Knowledge and Simplicial Complexes
Hans van Ditmarsch, Eric Goubault, Jeremy Ledent, Sergio Rajsbaum
https://drops.dagstuhl.de/entities/document/10.4230/DagRep.13.7.34
Epistemic and Topological Reasoning in Distributed Systems (Dagstuhl Seminar 23272)
Armando Castañeda, Hans van Ditmarsch, Roman Kuznets, Yoram Moses, Ulrich Schmid
Section 4.3 Representing Epistemic Attitudes via Simplicial Complexes
- - - - Wednesday, May 15, 2024 - - - -
- - - - Thursday, May 16, 2024 - - - -
*** FINAL EXAMS WEEK BEGINS - CUNY GRADUATE CENTER ***
- - - - Friday, May 17, 2024 - - - -
- - - - Monday, May 20, 2024 - - - -
- - - - Tuesday, May 21, 2024 - - - -
- - - - Wednesday, May 22, 2024 - - - -
- - - - Thursday, May 23, 2024 - - - -
- - - - Friday, May 24, 2024 - - - -
Find us on the web at: nylogic.github.io
(site designed, built & maintained by Victoria Gitman)
-------- ADMINISTRIVIA --------
To subscribe/unsubscribe to this list, please email your request to jreitz@citytech.cuny.edu.
If you have a logic-related event that you would like included in future mailings, please email jreitz@citytech.cuny.edu.
120 Years of Choice, Leeds, 8–12 July 2024
Set Theory in the United Kingdom, Oxford, 16 May 2024
Wednesday seminar
KGRC Set Theory Talks - May 12-17
This Week in Logic at CUNY
Logic and Metaphysics Workshop
Date: Monday, May 6, 4.15-6.15pm (NY time)
Room: Graduate Center Room 7395
Title: Alethic pluralism and Kripkean truth
Abstract: According to alethic pluralism, there is more than one way of being true: truth is not unique, in that there is a plurality of truth properties each of which pertains to a specific domain of discourse. This paper shows how such a plurality can be represented in a coherent formal framework by means of a Kripke-style construction that yields intuitively correct extensions for distinct truth predicates. The theory of truth it develops can handle at least three crucial problems that have been raised in connection with alethic pluralism: mixed compounds, mixed inferences, and semantic paradoxes.
Note: This is joint work with Andrea Iacona (Turin) and Stefano Romeo (Turin).
- - - - Tuesday, May 7, 2024 - - - -
CUNY Graduate Center
Virtual (email Victoria Gitman (vgitman@gmail.com) for meeting id)
Ali Enayat, University of Gothenburg
Tarski's undefinability of truth theorem strikes again
Tarski's undefinability of truth theorem has two versions, the first one deals with truth itself, takes some effort to prove, and is a descendant of the Epimenides (liar) paradox. The second one deals with the related concept of satisfaction, has a one-line proof, and is a descendent of Russell's paradox. This talk is about the first one, which appeared in the 1953 monograph 'Undecidable Theories' by Tarski, Mostowski, and Robinson; it was employed there to show the essential undecidability of consistent theories that can represent all recursive functions (a strong form of the Gödel-Rosser incompleteness theorem). I will present Tarski's original 1953 formulation (which differs from the common formulation in modern expositions) and will explain how it was used in my recent work with Albert Visser to show that no consistent completion of a sequential theory whose signature is finite is axiomatizable by a collection of sentences of bounded quantifier-alternation-depth. A variant of this result was proved independently by Emil Jeřábek, as I will explain. Our proof method has a pedagogical dividend since it allows one to replace the cryptic Gödel-Carnap fixed point lemma with the perspicuous undefinability of truth theorem in the proof of the Gödel-Rosser incompleteness theorem.
Tuesday, May 7, Time 2:00 - 4:00 PM (EDT)
zoom link: ask Sergei Artemov sartemov@gmail.com
Speaker: SREEHARI KALLOORMANA, Graduate Center CUNY
Title: Formal Argumentation Theory and Argumentation Logics.
Abstract: Deductive Logic is monotonic, in that when the set of premises grows, the set of conclusions grows as well. Since the 1980s, Non-monotonic Logics, where this does not hold, have been studied to model commonsense reasoning, especially in the field of artificial intelligence. In this talk, we will be looking at argument-based nonmonotonic logics, which formalize the notion of attack and defeat in the field of argumentation theory. We will consider briefly abstract argumentation frameworks and the various semantic notions proposed by P.M. Dung in 1995, followed by logic-based structured argumentation frameworks `a la John Pollock, and the more recent ASPIC framework. Various notions of argument attack/defeat fundamental to argumentation, such as rebuttal, undercutting, and undermining, will be discussed. We will then introduce and discuss the idea of reasoning about argumentation using Justification logic, by introducing priority orderings over formulas and justification terms.
- - - - Wednesday, May 8, 2024 - - - -
The New York City Category Theory Seminar
Department of Computer Science
Department of Mathematics
The Graduate Center of The City University of New York
URL: http://www.sci.brooklyn.cuny.edu/~noson/Seminar/index.html
Speaker: Juan Orendain, Case Western Univeristy.
Date and Time: Wednesday May 8, 2024, 7:00 - 8:30 PM. ZOOM TALK.
Title: Canonical squares in fully faithful and absolutely dense equipments.
Abstract: Equipments are categorical structures of dimension 2 having two separate types of 1-arrows -vertical and horizontal- and supporting restriction and extension of horizontal arrows along vertical ones. Equipments were defined by Wood in [W] as 2-functors satisfying certain conditions, but can also be understood as double categories satisfying a fibrancy condition as in [Sh]. In the zoo of 2-dimensional categorical structures, equipments nicely fit in between 2-categories and double categories, and are generally considered as the 2-dimensional categorical structures where synthetic category theory is done, and in some cases, where monoidal bicategories are more naturally defined.
In a previous talk in the seminar, I discussed the problem of lifting a 2-category into a double category along a given category of vertical arrows, and how this problem allows us to define a notion of length on double categories. The length of a double category is a number that roughly measures the amount of work one needs to do to reconstruct the double category from a bicategory along its set of vertical arrows.
In this talk I will review the length of double categories, and I will discuss two recent developments in the theory: In the paper [OM] a method for constructing different double categories from a given bicategory is presented. I will explain how this construction works. One of the main ingredients of the construction are so-called canonical squares. In the preprint [O] it is proven that in certain classes of equipments -fully faithful and absolutely dense- every square that can be canonical is indeed canonical. I will explain how from this, it can be concluded that fully faithful and absolutely dense equipments are of length 1, and so they can be 'easily' reconstructed from their horizontal bicategories.
References:
[O] Length of fully faithful framed bicategories. arXiv:2402.16296.
[OM] J. Orendain, R. Maldonado-Herrera, Internalizations of decorated bicategories via π-indexings. To appear in Applied Categorical Structures. arXiv:2310.18673.
[W] R. K. Wood, Abstract Proarrows I, Cahiers de topologie et géométrie différentielle 23 3 (1982) 279-290.
[Sh] M. Shulman, Framed bicategories and monoidal fibrations. Theory and Applications of Categories, Vol. 20, No. 18, 2008, pp. 650–738.
- - - - Thursday, May 9, 2024 - - - -
- - - - Friday, May 10, 2024 - - - -
CUNY Graduate Center
Friday May 10, 12:30pm NY time, Room: 6495
Alf Dolich, CUNY
The decidability of the rings Z/mZ
In this expository talk I will discuss recent work of Derakhshan and Macintyre on the decidability of the common theory of the rings Z/mZ as m varies through the natural numbers m>1.
CUNY Graduate Center
Friday May 10, 2:00pm-3:30pm, Room 5417
Roman Kossak, CUNY
The lattice problem for models of arithmetic
The lattice problem for models of PA is to determine which lattices can be represented either as lattices of elementary substructures of a model of PA or, more generally, which can be represented as lattices of elementary substructures of a model N that contain a given elementary substructure M of N.
Since the 1970's, the problem generated much research with highly nontrivial results with proofs combining specific methods in the model theory of arithmetic with lattice theory and various combinatorial theorems. The problem has a definite answer in the case of distributive lattices, and, despite much effort, there are still many open questions in the nondistributive case. I will briefly survey some early results and present a few proofs that illustrate the difference between the distributive and nondistributive cases.
- - - - Monday, May 13, 2024 - - - -
- - - - Tuesday, May 14, 2024 - - - -
- - - - Wednesday, May 15, 2024 - - - -
- - - - Thursday, May 16, 2024 - - - -
*** FINAL EXAMS WEEK BEGINS - CUNY GRADUATE CENTER ***
- - - - Friday, May 17, 2024 - - - -
Find us on the web at: nylogic.github.io
(site designed, built & maintained by Victoria Gitman)
-------- ADMINISTRIVIA --------
To subscribe/unsubscribe to this list, please email your request to jreitz@citytech.cuny.edu.
If you have a logic-related event that you would like included in future mailings, please email jreitz@citytech.cuny.edu.
Logic Seminar 8 May 2024 17:00 hrs at NUS
Fwd: 9 FMP: przestrzenie Banacha: geometria i operatory
Od: Grzegorz Plebanek <grzegorz.plebanek@math.uni.wroc.pl>
Date: wt., 30 kwi 2024 o 22:47
Subject: Fwd: 9 FMP: przestrzenie Banacha: geometria i operatory
To: Szymon Żeberski <szymon.zeberski@pwr.edu.pl>
Cc: <sebastian.jachimek@math.uni.wroc.pl>, Piotr Borodulin-Nadzieja <pborod@math.uni.wroc.pl>
Szymonie, rozeslij to, proszę do wszystkich z seminarium. To Jest wiadomość od Tomka Kanii (który prosi o informowanie wszystkich zainteresowanych) w sprawie sesji Przestrzenie Banacha, ale na liście konferencji jest też sesja Teoria Mnogości. Pozdrawiam, G
Od: Tomasz Kania <tomasz2.kania@uj.edu.pl>
Date: wt., 30 kwi 2024 o 21:10
Subject: 9 FMP: przestrzenie Banacha: geometria i operatory
okazuje się, że sesja z przestrzeni Banacha się odbędzie (nie jest jednak jeszcze jasne, którego dnia konferencji); jeżeli nadal wyrażasz zainteresowanie przyjazdem, bardzo proszę o przesłanie abstraktu na:
Abstrakty - 9. Forum Matematyków Polskich (us.edu.pl)
(oraz idealnie potwierdzenie emailowe do mnie, że udało Ci się posłać).
Set Theory Workshop "Compactness and Cardinal Invariants" Vienna, May 2, 2024
UPDATE: This Week in Logic at CUNY
Rutgers Logic Seminar
Monday Apr 29, 3:30pm Hill Center, Hill 705
Logic and Metaphysics Workshop
Date: Monday, April 29, 4.15-6.15pm (NY time)
Room: Graduate Center Room 7395
Title: Physicalism, intentionality and normativity: The essential explanatory gap
Abstract: In this paper, I present an explanatory gap argument against the view that the semantic facts are fully grounded in the physical facts. Unlike traditional explanatory gap arguments, which stem from the failure of analytic reductive explanation, the explanatory gap I point to stems from the failure of metaphysical explanation. I argue for the following theses. (i) Physicalist grounding claims are metaphysically necessary, if true. (ii) To be explanatorily adequate, these grounding claims must be deducible from facts about essence. (iii) Semantico-physical grounding claims are possibly false, not (only) because they are conceivably false, but because they cannot be deduced from facts about essence. (iv) Semantic properties are essentially weakly normative: it lies in their natures to have correctness conditions and subjectively rationalize—rather than merely cause—behaviour. This gives rise to an explanatory gap that indicates that the semantic facts are not fully grounded in the physical facts.
- - - - Tuesday, Apr 30, 2024 - - - -
Computational Logic Seminar
Spring 2024 (online)
Tuesday, April 30
Time 2:00 - 4:00 PM (EDT)
zoom link: ask Sergei Artemov sartemov@gmail.com
Speaker: Benjamin PrudHomme, Graduate Center CUNY
Title: On Game Theory and Epistemic Logic
Abstract: Review of basic game theory and epistemic game theory concepts, including strictly competitive games, pure and mixed strategy Nash equilibria, rationalizability, models of knowledge, distinction between mutual and common knowledge. Review of proofs of when a game has a Nash equilibrium, Nash's Theorem, Muddy Children Problem. Discussions of current and potential future efforts to utilize logic in developing a more comprehensive theory of pure strategy solutions.
- - - - Wednesday, May 1, 2024 - - - -
- - - - Thursday, May 2, 2024 - - - -
- - - - Friday, May 3, 2024 - - - -
CUNY Graduate Center
Friday May 3, 12:30pm NY time, Room: 6495
Genericity in models of arithmetic
In this talk, I plan to explore a few notions of 'genericity' in the context of models of arithmetic. I will recall the notion of genericity borrowed from set-theory, used by Simpson to prove that every countable model of PA has an expansion to a pointwise definable model of PA*. I will then explore other notions of genericity inspired by more model-theoretic contexts. One such notion is 'neutrality': in a model M, we say an undefinable set X is neutral if the definable closure relation in (M, X) is the same as in M. Another notion, inspired by work done on model-theoretic genericity by Chatzidakis and Pillay, is called CP-genericity. I will explore these notions and outline some results, including: (1) every model of PA has a neutral set which is not CP-generic, (2) every countable model of PA has a CP-generic which is not neutral (and in fact, fails neutrality spectacularly: ie, we can find a CP-generic where the expansion is pointwise definable), and (3) every countable model of PA has a neutral CP-generic. This talk touches on work contained in two papers, one of which was joint work with Roman Kossak, and the other was joint work with James Schmerl.
CUNY Graduate Center
Friday, May 3, 12:30pm NY time
Virtual: Please email Victoria Gitman (vgitman@gmail.com) for meeting id.
Spencer Unger, University of Toronto
Iterated ultrapower methods in analysis of Prikry type forcing
We survey some old and new results in singular cardinal combinatorics whose proofs can be phrased in terms of iterated ultrapowers and ask a few questions.
CUNY Graduate Center
Friday May 3, 2:00pm-3:30pm, Room 5417
Christian Wolf, CUNY
Computability of entropy and pressure on compact symbolic spaces beyond finite type
In this talk we discuss the computability of the entropy and topological pressure on compact shift spaces and continuous potentials . This question has recently been studied for subshifts of finite type (SFTs) and their factors (Sofic shifts). We develop a framework to address the computability of the entropy pressure on general shift spaces and apply this framework to coded shifts. In particular, we prove the computability of the topological pressure for all continuous potentials on S-gap shifts, generalized gap shifts, and Beta shifts. We also construct shift spaces which, depending on the potential, exhibit computability and non-computability of the topological pressure. We further show that the generalized pressure function is not computable for a large set of shift spaces and potentials . Along the way of developing these computability results, we derive several ergodic-theoretical properties of coded shifts which are of independent interest beyond the realm of computability. The topic of the talk is joint work with Michael Burr (Clemson U.), Shuddho Das (Texas Tech) and Yun Yang (Virginia Tech).
- - - - Monday, May 6, 2024 - - - -
Logic and Metaphysics Workshop
Date: Monday, May 6, 4.15-6.15pm (NY time)
Room: Graduate Center Room 7395
Title: Alethic pluralism and Kripkean truth
Abstract: According to alethic pluralism, there is more than one way of being true: truth is not unique, in that there is a plurality of truth properties each of which pertains to a specific domain of discourse. This paper shows how such a plurality can be represented in a coherent formal framework by means of a Kripke-style construction that yields intuitively correct extensions for distinct truth predicates. The theory of truth it develops can handle at least three crucial problems that have been raised in connection with alethic pluralism: mixed compounds, mixed inferences, and semantic paradoxes.
Note: This is joint work with Andrea Iacona (Turin) and Stefano Romeo (Turin).
- - - - Tuesday, May 7, 2024 - - - -
- - - - Wednesday, May 8, 2024 - - - -
The New York City Category Theory Seminar
Department of Computer Science
Department of Mathematics
The Graduate Center of The City University of New York
URL: http://www.sci.brooklyn.cuny.edu/~noson/Seminar/index.html
Speaker: Juan Orendain, Case Western Univeristy.
Date and Time: Wednesday May 8, 2024, 7:00 - 8:30 PM. ZOOM TALK.
Title: Canonical squares in regularly framed bicategories.
- - - - Thursday, May 9, 2024 - - - -
- - - - Friday, May 10, 2024 - - - -
CUNY Graduate Center
Friday May 10, 2:00pm-3:30pm, Room 5417
Roman Kossak, CUNY
The lattice problem for models of arithmetic
The lattice problem for models of PA is to determine which lattices can be represented either as lattices of elementary substructures of a model of PA or, more generally, which can be represented as lattices of elementary substructures of a model N that contain a given elementary substructure M of N.
Since the 1970's, the problem generated much research with highly nontrivial results with proofs combining specific methods in the model theory of arithmetic with lattice theory and various combinatorial theorems. The problem has a definite answer in the case of distributive lattices, and, despite much effort, there are still many open questions in the nondistributive case. I will briefly survey some early results and present a few proofs that illustrate the difference between the distributive and nondistributive cases.
Speakers:
Paul Baginski (Fairfield)
Artem Chernikov (Maryland)
Alf Dolich (CUNY)
Alexei Kolesnikov (Towson)
NEMTD 2024 sponsored by the Mid-Atlantic Mathematical Logic Seminar (NSF grant #DMS-1834219) and the Wesleyan Department of Mathematics and Computer Science.
Organizers: Alex Kruckman, Rehana Patel, Alex Van Abel. Contact akruckman@wesleyan.edu with any questions.
Find us on the web at: nylogic.github.io
(site designed, built & maintained by Victoria Gitman)
-------- ADMINISTRIVIA --------
To subscribe/unsubscribe to this list, please email your request to jreitz@citytech.cuny.edu.
If you have a logic-related event that you would like included in future mailings, please email jreitz@citytech.cuny.edu.
Cross-Alps Logic Seminar (speaker: Spencer Unger)
Spencer Unger (University of Toronto)
will give a talk on
Iterated ultrapower methods
This Week in Logic at CUNY
Rutgers Logic Seminar
Monday Apr 29, 3:30pm Hill Center, Hill 705
Logic and Metaphysics Workshop
Date: Monday, April 29, 4.15-6.15pm (NY time)
Room: Graduate Center Room 7395
Title: Physicalism, intentionality and normativity: The essential explanatory gap
Abstract: In this paper, I present an explanatory gap argument against the view that the semantic facts are fully grounded in the physical facts. Unlike traditional explanatory gap arguments, which stem from the failure of analytic reductive explanation, the explanatory gap I point to stems from the failure of metaphysical explanation. I argue for the following theses. (i) Physicalist grounding claims are metaphysically necessary, if true. (ii) To be explanatorily adequate, these grounding claims must be deducible from facts about essence. (iii) Semantico-physical grounding claims are possibly false, not (only) because they are conceivably false, but because they cannot be deduced from facts about essence. (iv) Semantic properties are essentially weakly normative: it lies in their natures to have correctness conditions and subjectively rationalize—rather than merely cause—behaviour. This gives rise to an explanatory gap that indicates that the semantic facts are not fully grounded in the physical facts.
- - - - Tuesday, Apr 30, 2024 - - - -
- - - - Wednesday, May 1, 2024 - - - -
- - - - Thursday, May 2, 2024 - - - -
- - - - Friday, May 3, 2024 - - - -
CUNY Graduate Center
Friday May 3, 12:30pm NY time, Room: 6495
Genericity in models of arithmetic
In this talk, I plan to explore a few notions of 'genericity' in the context of models of arithmetic. I will recall the notion of genericity borrowed from set-theory, used by Simpson to prove that every countable model of PA has an expansion to a pointwise definable model of PA*. I will then explore other notions of genericity inspired by more model-theoretic contexts. One such notion is 'neutrality': in a model M, we say an undefinable set X is neutral if the definable closure relation in (M, X) is the same as in M. Another notion, inspired by work done on model-theoretic genericity by Chatzidakis and Pillay, is called CP-genericity. I will explore these notions and outline some results, including: (1) every model of PA has a neutral set which is not CP-generic, (2) every countable model of PA has a CP-generic which is not neutral (and in fact, fails neutrality spectacularly: ie, we can find a CP-generic where the expansion is pointwise definable), and (3) every countable model of PA has a neutral CP-generic. This talk touches on work contained in two papers, one of which was joint work with Roman Kossak, and the other was joint work with James Schmerl.
CUNY Graduate Center
Friday, May 3, 12:30pm NY time
Virtual: Please email Victoria Gitman (vgitman@gmail.com) for meeting id.
Spencer Unger, University of Toronto
Iterated ultrapower methods in analysis of Prikry type forcing
We survey some old and new results in singular cardinal combinatorics whose proofs can be phrased in terms of iterated ultrapowers and ask a few questions.
CUNY Graduate Center
Friday May 3, 2:00pm-3:30pm, Room 5417
Christian Wolf, CUNY
Computability of entropy and pressure on compact symbolic spaces beyond finite type
In this talk we discuss the computability of the entropy and topological pressure on compact shift spaces and continuous potentials . This question has recently been studied for subshifts of finite type (SFTs) and their factors (Sofic shifts). We develop a framework to address the computability of the entropy pressure on general shift spaces and apply this framework to coded shifts. In particular, we prove the computability of the topological pressure for all continuous potentials on S-gap shifts, generalized gap shifts, and Beta shifts. We also construct shift spaces which, depending on the potential, exhibit computability and non-computability of the topological pressure. We further show that the generalized pressure function is not computable for a large set of shift spaces and potentials . Along the way of developing these computability results, we derive several ergodic-theoretical properties of coded shifts which are of independent interest beyond the realm of computability. The topic of the talk is joint work with Michael Burr (Clemson U.), Shuddho Das (Texas Tech) and Yun Yang (Virginia Tech).
- - - - Monday, May 6, 2024 - - - -
Logic and Metaphysics Workshop
Date: Monday, May 6, 4.15-6.15pm (NY time)
Room: Graduate Center Room 7395
Title: Alethic pluralism and Kripkean truth
Abstract: According to alethic pluralism, there is more than one way of being true: truth is not unique, in that there is a plurality of truth properties each of which pertains to a specific domain of discourse. This paper shows how such a plurality can be represented in a coherent formal framework by means of a Kripke-style construction that yields intuitively correct extensions for distinct truth predicates. The theory of truth it develops can handle at least three crucial problems that have been raised in connection with alethic pluralism: mixed compounds, mixed inferences, and semantic paradoxes.
Note: This is joint work with Andrea Iacona (Turin) and Stefano Romeo (Turin).
- - - - Tuesday, May 7, 2024 - - - -
- - - - Wednesday, May 8, 2024 - - - -
The New York City Category Theory Seminar
Department of Computer Science
Department of Mathematics
The Graduate Center of The City University of New York
URL: http://www.sci.brooklyn.cuny.edu/~noson/Seminar/index.html
Speaker: Juan Orendain, Case Western Univeristy.
Date and Time: Wednesday May 8, 2024, 7:00 - 8:30 PM. ZOOM TALK.
Title: Canonical squares in regularly framed bicategories.
- - - - Thursday, May 9, 2024 - - - -
- - - - Friday, May 10, 2024 - - - -
CUNY Graduate Center
Friday May 10, 2:00pm-3:30pm, Room 5417
Roman Kossak, CUNY
The lattice problem for models of arithmetic
The lattice problem for models of PA is to determine which lattices can be represented either as lattices of elementary substructures of a model of PA or, more generally, which can be represented as lattices of elementary substructures of a model N that contain a given elementary substructure M of N.
Since the 1970's, the problem generated much research with highly nontrivial results with proofs combining specific methods in the model theory of arithmetic with lattice theory and various combinatorial theorems. The problem has a definite answer in the case of distributive lattices, and, despite much effort, there are still many open questions in the nondistributive case. I will briefly survey some early results and present a few proofs that illustrate the difference between the distributive and nondistributive cases.
Speakers:
Paul Baginski (Fairfield)
Artem Chernikov (Maryland)
Alf Dolich (CUNY)
Alexei Kolesnikov (Towson)
NEMTD 2024 sponsored by the Mid-Atlantic Mathematical Logic Seminar (NSF grant #DMS-1834219) and the Wesleyan Department of Mathematics and Computer Science.
Organizers: Alex Kruckman, Rehana Patel, Alex Van Abel. Contact akruckman@wesleyan.edu with any questions.
Find us on the web at: nylogic.github.io
(site designed, built & maintained by Victoria Gitman)
-------- ADMINISTRIVIA --------
To subscribe/unsubscribe to this list, please email your request to jreitz@citytech.cuny.edu.
If you have a logic-related event that you would like included in future mailings, please email jreitz@citytech.cuny.edu.
KGRC Set Theory Talk - May 2
Wednesday seminar
51st Nankai Logic Colloquium
Hello everyone,
This week our weekly Nankai Logic Colloquium is going to be in the afternoon.
Our speaker this week will be Jiachen Yuan from the University of Leeds. This talk is going to take place this Friday, Apr 26, from 4pm to 5pm(UTC+8, Beijing time).
This is going to be an online event. Follow the link below to join the Zoom meeting. Please use your real name to join the meeting.
Title :The 51st Nankai Logic Colloquium -- Jiachen Yuan
Time :16:00pm, Apr. 26, 2024(Beijing Time)
Zoom Number : 734 242 5443
Passcode :477893
Link :https://zoom.us/j/7342425443?pwd=NnO2EFts9VOfCR9eDFUkoI3lNn2QTo.1&omn=84627872662
_____________________________________________________________________
Best wishes,
Ming Xiao
This Week in Logic at CUNY
*** CUNY SPRING RECESS APRIL 22 - 30 ***
Monday Apr 22, 3:30pm Hill Center, Hill 705
Dave Marker, University of Illinois at Chicago
Rigid real closed fields
- - - - Tuesday, Apr 23, 2024 - - - -
Computational Logic Seminar
Spring 2024 (online)
zoom link: ask Sergei Artemov (sartemov@gmail.com)
Speaker: Thomas Schlögl, Technische Universität Wien
Title: Epistemic Modeling of Truly Private Updates and a Glance at
a New Epistemic Model Checking and Visualization Tool
Abstract: Epistemic logic has been successfully applied to the modeling of epistemic and doxastic attitudes of agents in distributed systems. Dynamic Epistemic Logic (DEL) adds communication via model transforming updates. Since agents in distributed systems often exchange information without other agents knowing, however, the commonly known model updates in DEL are generally not adequate for describing fully private communication. In this talk, I will present a novel update mechanism for solving the fully private consistent update synthesis task: designing a model update that makes a given goal formula true while maintaining the consistency of the agents’ beliefs.
In addition, I will provide a first glimpse of the alpha version of a performant epistemic model checking and visualization tool I am currently working on. Model-checking allows us to verify whether a finite-state model (typically represented as a Kripke structure) satisfies a given specification. Many model-checking tools exist for a variety of logical languages, including epistemic logic. To effectively support foundational theoretical research like developing sound and efficient fully private model updates, however, a tool is needed that simultaneously provides:
.) a flexible and intuitive user interface,
.) powerful visualization capabilities for large models (>10,000 states),
.) a performant model-checking algorithm that also provides explanations/proofs/counter-examples
.) easy extendability w.r.t. logical language features and model generation/updates
- - - - Wednesday, Apr 24, 2024 - - - -
- - - - Thursday, Apr 25, 2024 - - - -
- - - - Friday, Apr 26, 2024 - - - -
*** CUNY SPRING RECESS APRIL 22 - 30 ***
Logic and Metaphysics Workshop
Date: Monday, April 29, 4.15-6.15pm (NY time)
Room: Graduate Center Room 7395
Title: Physicalism, intentionality and normativity: The essential explanatory gap
Abstract: In this paper, I present an explanatory gap argument against the view that the semantic facts are fully grounded in the physical facts. Unlike traditional explanatory gap arguments, which stem from the failure of analytic reductive explanation, the explanatory gap I point to stems from the failure of metaphysical explanation. I argue for the following theses. (i) Physicalist grounding claims are metaphysically necessary, if true. (ii) To be explanatorily adequate, these grounding claims must be deducible from facts about essence. (iii) Semantico-physical grounding claims are possibly false, not (only) because they are conceivably false, but because they cannot be deduced from facts about essence. (iv) Semantic properties are essentially weakly normative: it lies in their natures to have correctness conditions and subjectively rationalize—rather than merely cause—behaviour. This gives rise to an explanatory gap that indicates that the semantic facts are not fully grounded in the physical facts.
- - - - Tuesday, Apr 30, 2024 - - - -
- - - - Wednesday, May 1, 2024 - - - -
- - - - Thursday, May 2, 2024 - - - -
- - - - Friday, May 3, 2024 - - - -
CUNY Graduate Center
Friday, May 3, 12:30pm NY time
Virtual: Please email Victoria Gitman (vgitman@gmail.com) for meeting id.
Spencer Unger, University of Toronto
Iterated ultrapower methods in analysis of Prikry type forcing
We survey some old and new results in singular cardinal combinatorics whose proofs can be phrased in terms of iterated ultrapowers and ask a few questions.
CUNY Graduate Center
Friday May 3, 2:00pm-3:30pm, Room 5417
Christian Wolf, CUNY
Computability of entropy and pressure on compact symbolic spaces beyond finite type
In this talk we discuss the computability of the entropy and topological pressure on compact shift spaces and continuous potentials . This question has recently been studied for subshifts of finite type (SFTs) and their factors (Sofic shifts). We develop a framework to address the computability of the entropy pressure on general shift spaces and apply this framework to coded shifts. In particular, we prove the computability of the topological pressure for all continuous potentials on S-gap shifts, generalized gap shifts, and Beta shifts. We also construct shift spaces which, depending on the potential, exhibit computability and non-computability of the topological pressure. We further show that the generalized pressure function is not computable for a large set of shift spaces and potentials . Along the way of developing these computability results, we derive several ergodic-theoretical properties of coded shifts which are of independent interest beyond the realm of computability. The topic of the talk is joint work with Michael Burr (Clemson U.), Shuddho Das (Texas Tech) and Yun Yang (Virginia Tech).
Speakers:
Paul Baginski (Fairfield)
Artem Chernikov (Maryland)
Alf Dolich (CUNY)
Alexei Kolesnikov (Towson)
NEMTD 2024 sponsored by the Mid-Atlantic Mathematical Logic Seminar (NSF grant #DMS-1834219) and the Wesleyan Department of Mathematics and Computer Science.
Organizers: Alex Kruckman, Rehana Patel, Alex Van Abel. Contact akruckman@wesleyan.edu with any questions.
Find us on the web at: nylogic.github.io
(site designed, built & maintained by Victoria Gitman)
-------- ADMINISTRIVIA --------
To subscribe/unsubscribe to this list, please email your request to jreitz@citytech.cuny.edu.
If you have a logic-related event that you would like included in future mailings, please email jreitz@citytech.cuny.edu.
Wednesday seminar
Set theory and topology seminar 23.04.2024 Tomasz Żuchowski
Tomasz Żuchowski
(on behalf of the organizers, i.e. Piotr Borodulin-Nadzieja, Paweł Krupski, Aleksandra Kwiatkowska, Grzegorz Plebanek, Robert Rałowski and myself)
About 15 minutes before the seminar we invite you for coffee and a chat to social room A.4.1.A in C-19.
https://settheory.pwr.edu.pl/
http://www.math.uni.wroc.pl/seminarium/topologia
KGRC Talks - April 25
50th Nankai Logic Colloquium
Hello everyone,
This week our weekly Nankai Logic Colloquium is going to be in the afternoon, but at an irregular time, as we have two speakers this week.
Time(Stevo Todorcevic) :14:30pm, Apr. 19, 2024(Beijing Time)
Time(Dilip Raghavan) :16:00pm, Apr. 19, 2024(Beijing Time)
Zoom Number : 734 242 5443
Passcode :477893
Link :https://zoom.us/j/7342425443?pwd=NnO2EFts9VOfCR9eDFUkoI3lNn2QTo.1&omn=81450804954
_____________________________________________________________________
The records of past talks can be accessed at https://space.bilibili.com/253421893.
Best wishes,
Ming Xiao
This Week in Logic at CUNY
Rutgers Logic Seminar
Monday Apr 15, 3:30pm Hill Center, Hill 705
Logic and Metaphysics Workshop
Date: Monday, April 15, 4.15-6.15pm (NY time)
Room: Graduate Center Room 7395
Title: Imaging is Alpha + Aizerman
Abstract: I give a non-probabilistic account of the imaging revision process. Most familiar in its various probabilistic forms, imaging was introduced by David Lewis (1976) as the form of belief revision appropriate for supposing subjunctively that a hypothesis be true. It has played a central role in the semantics of subjunctive conditionals, in causal decision theory, and, less well known to philosophers, in the computational theory of information retrieval. In the economics literature, non-probabilistic imaging functions have been called “pseudo-rationalizable choice functions”. I show that the imaging functions are precisely those which satisfy both Sen’s Alpha Principle (aka “Chernoff’s Axiom”) and the Aizerman Axiom. This result allows us to see very clearly the formal relationship between non-probabilistic imaging and AGM revision (which is Alpha + Beta).
- - - - Tuesday, Apr 16, 2024 - - - -
Computational Logic Seminar
Spring 2024 (online)
Tuesday, April 16, Time 2:00 - 4:00 PM
zoom link: contact Sergei Artemov (sartemov@gmail.com)
Speaker: Lukas Zenger, University of Bern
Title: Intuitionistic modal logic with the master modality
- - - - Wednesday, Apr 17, 2024 - - - -
- - - - Thursday, Apr 18, 2024 - - - -
- - - - Friday, Apr 19, 2024 - - - -
CUNY Graduate Center
Friday April 19, 2:00pm-3:30pm, Room 5417
Some applications of model theory to lattice-ordered groups
When does a hyperarchimedean lattice-ordered group embed into a hyperarchimedean lattice-ordered group with strong unit? After explaining the meaning of this question, I will describe some partial answers obtained via model theory.
- - - - Monday, Apr 22, 2024 - - - -
*** CUNY SPRING RECESS APRIL 22 - 30 ***
- - - - Tuesday, Apr 23, 2024 - - - -
*** CUNY SPRING RECESS APRIL 22 - 30 ***
- - - - Wednesday, Apr 24, 2024 - - - -
*** CUNY SPRING RECESS APRIL 22 - 30 ***
- - - - Thursday, Apr 25, 2024 - - - -
*** CUNY SPRING RECESS APRIL 22 - 30 ***
- - - - Friday, Apr 26, 2024 - - - -
Speakers:
Paul Baginski (Fairfield)
Artem Chernikov (Maryland)
Alf Dolich (CUNY)
Alexei Kolesnikov (Towson)
NEMTD 2024 sponsored by the Mid-Atlantic Mathematical Logic Seminar (NSF grant #DMS-1834219) and the Wesleyan Department of Mathematics and Computer Science.
Organizers: Alex Kruckman, Rehana Patel, Alex Van Abel. Contact akruckman@wesleyan.edu with any questions.
Find us on the web at: nylogic.github.io
(site designed, built & maintained by Victoria Gitman)
-------- ADMINISTRIVIA --------
To subscribe/unsubscribe to this list, please email your request to jreitz@citytech.cuny.edu.
If you have a logic-related event that you would like included in future mailings, please email jreitz@citytech.cuny.edu.
KGRC Talks - April 18
Set theory and toplogy seminar 16.04.2024 Krzysztof Zakrzewski (UW)
Krzysztof Zakrzewski (MIM UW)
Wednesday seminar
Two Related Seminars in Geometry and Topology by Shlpak Banerjee and in Logic by Philipp Kunde on Wednesday 17 April 2024
This Week in Logic at CUNY
Rutgers Logic Seminar
Monday Apr 8, Hill Center, Hill 705, SPECIAL TIME: 4:00pm
Jing Zhang, Toronto
Squares, ultrafilters and forcing axioms
Logic and Metaphysics Workshop
Date: Monday, April 8, 4.15-6.15pm (NY time)
Room: Graduate Center Room 7395
Title: Social construction and meta-ground
Abstract: The notion of social construction plays an important role in many areas of social philosophy, including the philosophy of gender, the philosophy of race, and social ontology. But it is far from clear how this notion (or cluster of notions) is to be understood. One promising proposal, which has been championed in recent years by Aaron Griffith (2017, 2018) and Jonathan Schaffer (2017), is that the notion of constitutive social construction may be analyzed in terms of the notion of metaphysical grounding. In this paper, I argue that a simple ground-theoretic analysis of social construction is subject to two sorts of problem cases and that existing ground-theoretic accounts do not avoid these problems. I then develop a novel ground-theoretic account of social construction in terms of meta-ground, and I argue that it avoids the problems. The core idea of the account is that in cases of social construction, the meta-ground of the relevant grounding fact includes a suitable connective social fact.
- - - - Tuesday, Apr 9, 2024 - - - -
MOPA (Models of Peano Arithmetic)
CUNY Graduate Center
Virtual (email Victoria Gitman for meeting id)
Tuesday, April 9, 1pm
Athar Abdul-Quader, Purchase College
Representations of lattices
- - - - Wednesday, Apr 10, 2024 - - - -
Department of Computer Science
Department of Mathematics
The Graduate Center of The City University of New York
URL: http://www.sci.brooklyn.cuny.edu/~noson/Seminar/index.html
Date and Time: Wednesday April 10, 2024, 7:00 - 8:30 PM. IN-PERSON
Title: Pulse Diagrams and Category Theory.
Abstract: ``Pulse diagrams'' are motivated by the ubiquity of pulsation in biology, from action potentials, to heartbeat, to respiration, and at longer time-scales to circadian rhythms and even to human behavior. The syntax of the diagrams is simple, and the semantics are easy to define and simulate with Python code. They express behaviors of parts and wholes as in categorical mereology, but are missing a compositional framework, like string diagrams. Examples to discuss include cellular automata, leaky-integrate-and-fire neurons, harmonic frequency generation, Gillespie algorithm for the chemical master equation, piecewise-linear genetic regulatory networks, Lotka-Volterra systems, and if time permits, aspects of the adaptive immune system. The talk is more about questions than about answers.
- - - - Thursday, Apr 11, 2024 - - - -
- - - - Friday, Apr 12, 2024 - - - -
CUNY Graduate Center
Friday, April 12, 12:30pm NY time
Virtual: Please email Victoria Gitman (vgitman@gmail.com) for meeting id.
Boban Velickovic University of Paris
Logic Workshop
CUNY Graduate Center
Friday April 12, 2:00pm-3:30pm, Room 5417
Hans Schoutens, CUNY
Geometric tools for the decidability of the existential theory of
I will give a brief survey how tools from algebraic geometry can be used in finding solutions to Diophantine equations over and similar rings. These tools include Artin approximation, arc spaces, motives and resolution of singularities. This approach yields the definability of the existential theory of (in the ring language with a constant for ) contingent upon the validity of resolution of singularities (Denef-Schoutens). Anscombe-Fehm proved a weaker result using model-theoretic tools and together with Dittmann, they gave a proof assuming only the weaker 'local uniformization conjecture.'
- - - - Monday, Apr 15, 2024 - - - -
Rutgers Logic Seminar
Monday Apr 15, 3:30pm Hill Center, Hill 705
Logic and Metaphysics Workshop
Date: Monday, April 15, 4.15-6.15pm (NY time)
Room: Graduate Center Room 7395
Title: Imaging is Alpha + Aizerman
Abstract: I give a non-probabilistic account of the imaging revision process. Most familiar in its various probabilistic forms, imaging was introduced by David Lewis (1976) as the form of belief revision appropriate for supposing subjunctively that a hypothesis be true. It has played a central role in the semantics of subjunctive conditionals, in causal decision theory, and, less well known to philosophers, in the computational theory of information retrieval. In the economics literature, non-probabilistic imaging functions have been called “pseudo-rationalizable choice functions”. I show that the imaging functions are precisely those which satisfy both Sen’s Alpha Principle (aka “Chernoff’s Axiom”) and the Aizerman Axiom. This result allows us to see very clearly the formal relationship between non-probabilistic imaging and AGM revision (which is Alpha + Beta).
- - - - Tuesday, Apr 16, 2024 - - - -
- - - - Wednesday, Apr 17, 2024 - - - -
- - - - Thursday, Apr 18, 2024 - - - -
- - - - Friday, Apr 19, 2024 - - - -
CUNY Graduate Center
Friday April 19, 2:00pm-3:30pm, Room 5417
Some applications of model theory to lattice-ordered groups
When does a hyperarchimedean lattice-ordered group embed into a hyperarchimedean lattice-ordered group with strong unit? After explaining the meaning of this question, I will describe some partial answers obtained via model theory.
Speakers:
Paul Baginski (Fairfield)
Artem Chernikov (Maryland)
Alf Dolich (CUNY)
Alexei Kolesnikov (Towson)
NEMTD 2024 sponsored by the Mid-Atlantic Mathematical Logic Seminar (NSF grant #DMS-1834219) and the Wesleyan Department of Mathematics and Computer Science.
Organizers: Alex Kruckman, Rehana Patel, Alex Van Abel. Contact akruckman@wesleyan.edu with any questions.
Logic Seminar Tuesday 9 April 2023 by Piotr Kowalski
KGRC Talk - April 11
Nankai Logic Colloquium paused for two weeks
Set theory and topology seminar 9.04.2024 Jakub Rondos
Jakub Rondos (University of Vienna)
(on behalf of the organizers, i.e. Piotr Borodulin-Nadzieja, Paweł Krupski, Aleksandra Kwiatkowska, Grzegorz Plebanek, Robert Rałowski and myself)
About 15 minutes before the seminar we invite you for coffee and a chat to social room A.4.1.A in C-19.
https://settheory.pwr.edu.pl/
http://www.math.uni.wroc.pl/seminarium/topologia
Cross-Alps Logic Seminar (speaker: Luca Motto Ros)
This Week in Logic at CUNY
Logic and Metaphysics Workshop
Date: Monday, April 1, 4.15-6.15pm (NY time)
Room: Graduate Center Room 7395
Andrew Tedder (Vienna).
Title: Relevant logics as topical logics
Abstract: There is a simple way of reading a structure of topics into the matrix models of a given logic, namely by taking the topics of a given matrix model to be represented by subalgebras of the algebra reduct of the matrix, and then considering assignments of subalgebras to formulas. The resulting topic-enriched matrix models bear suggestive similarities to the two-component frame models developed by Berto et. al. in Topics of Thought. In this talk I’ll show how this reading of topics can be applied to the relevant logic R, and its algebraic characterisation in terms of De Morgan monoids, and indicate how we can, using this machinery and the fact that R satisfies the variable sharing property, read R as a topic-sensitive logic. I’ll then suggest how this approach to modeling topics can be applied to a broader range of logics/classes of matrices, and gesture at some avenues of research.
- - - - Tuesday, Apr 2, 2024 - - - -
MOPA (Models of Peano Arithmetic)
CUNY Graduate Center
Virtual (email Victoria Gitman for meeting id)
Tuesday, April 2, 1pm
Athar Abdul-Quader, Purchase College
Representations of lattices
Following up on the series of talks on the history of the problem, in this talk we will discuss the main technique for realizing finite lattices as interstructure lattices, due to Schmerl in 1986. We will motivate this technique by studying an example: the Boolean algebra . We will see how we can modify the technique to produce elementary extensions realizing specific ranked lattices to ensure that such extensions are end, cofinal, or mixed extensions.
Spring 2024 (online)
Abstract: In this presentation I focus on a framework that generalizes dynamic epistemic logic in order to model a wider range of scenarios including those in which agents read or communicate (or somehow gain access to) all the information stored at specific sources, or possessed by some other agents (including information of a non-propositional nature, such as data, passwords, secrets etc). The resulting framework allows one to reason about the state of affairs in which one agent (or group of agents) has ‘epistemic superiority’ over another agent (or group). I will present different examples of epistemic superiority and I will draw a connection to the logic of functional dependence by A. Baltag and J. van Benthem. At the level of group attitudes, I will further introduce the new concept of 'common distributed knowledge', which combines features of both common knowledge and distributed knowledge. This presentation is based on joint work with A. Baltag in [1].
[1] A. Baltag and S. Smets, Learning what others know, in L. Kovacs and E. Albert (eds.), LPAR23 proceedings of the International Conference on Logic for Programming, AI and Reasoning, EPiC Series in Computing, 73:90-110, 2020. https://doi.org/10.29007/plm4
- - - - Wednesday, Apr 3, 2024 - - - -
- - - - Thursday, Apr 4, 2024 - - - -
- - - - Friday, Apr 5, 2024 - - - -
April 5, Friday, 10 AM
Zoom meeting, please contact Rohit Parikh for zoom link
CUNY Graduate Center
Friday, April 5, 12:30pm NY time
Virtual: Please email Victoria Gitman (vgitman@gmail.com) for meeting id.
Kameryn Williams Bard College at Simon's Rock
Logic Workshop
CUNY Graduate Center
Friday April 5, 2:00pm-3:30pm, Room 5417
Decision problem for groups as equivalence relations
In 1911, Dehn proposed three decision problems for finitely presented groups: the word problem, the conjugacy problem, and the isomorphism problem. These problems have been central to both group theory and logic, and were each proven to be undecidable in the 50's. There is much current research studying the decidability of these problems in certain classes of groups.
Classically, when a decision problem is undecidable, its complexity is measured using Turing reducibility. However, Dehn's problems can also be naturally thought of as computably enumerable equivalence relations (ceers). We take this point of view and measure their complexity using computable reductions. This yields behaviors different from the classical context: for instance, every Turing degree contains a word problem, but not every ceer degree does. This leads us to study the structure of ceer degrees containing a word problem and other related questions.
- - - - Monday, Apr 8, 2024 - - - -
Rutgers Logic Seminar
Monday Apr 8, 3:30pm, Hill Center, Hill 705
Jing Zhang
Logic and Metaphysics Workshop
Date: Monday, April 8, 4.15-6.15pm (NY time)
Room: Graduate Center Room 7395
Title: Social construction and meta-ground
Abstract: The notion of social construction plays an important role in many areas of social philosophy, including the philosophy of gender, the philosophy of race, and social ontology. But it is far from clear how this notion (or cluster of notions) is to be understood. One promising proposal, which has been championed in recent years by Aaron Griffith (2017, 2018) and Jonathan Schaffer (2017), is that the notion of constitutive social construction may be analyzed in terms of the notion of metaphysical grounding. In this paper, I argue that a simple ground-theoretic analysis of social construction is subject to two sorts of problem cases and that existing ground-theoretic accounts do not avoid these problems. I then develop a novel ground-theoretic account of social construction in terms of meta-ground, and I argue that it avoids the problems. The core idea of the account is that in cases of social construction, the meta-ground of the relevant grounding fact includes a suitable connective social fact.
- - - - Tuesday, Apr 9, 2024 - - - -
- - - - Wednesday, Apr 10, 2024 - - - -
- - - - Thursday, Apr 11, 2024 - - - -
- - - - Friday, Apr 12, 2024 - - - -
CUNY Graduate Center
Friday, April 12, 12:30pm NY time
Virtual: Please email Victoria Gitman (vgitman@gmail.com) for meeting id.
Boban Velickovic University of Paris
Logic Workshop
CUNY Graduate Center
Friday April 12, 2:00pm-3:30pm, Room 5417
Hans Schoutens, CUNY
Geometric tools for the decidability of the existential theory of
I will give a brief survey how tools from algebraic geometry can be used in finding solutions to Diophantine equations over and similar rings. These tools include Artin approximation, arc spaces, motives and resolution of singularities. This approach yields the definability of the existential theory of (in the ring language with a constant for ) contingent upon the validity of resolution of singularities (Denef-Schoutens). Anscombe-Fehm proved a weaker result using model-theoretic tools and together with Dittmann, they gave a proof assuming only the weaker 'local uniformization conjecture.'
Speakers:
Paul Baginski (Fairfield)
Artem Chernikov (Maryland)
Alf Dolich (CUNY)
Alexei Kolesnikov (Towson)
NEMTD 2024 sponsored by the Mid-Atlantic Mathematical Logic Seminar (NSF grant #DMS-1834219) and the Wesleyan Department of Mathematics and Computer Science.
Organizers: Alex Kruckman, Rehana Patel, Alex Van Abel. Contact akruckman@wesleyan.edu with any questions.
Find us on the web at: nylogic.github.io
(site designed, built & maintained by Victoria Gitman)
Wednesday seminar
49th Nankai Logic Colloquium
Hello everyone,
This week our weekly Nankai Logic Colloquium is going to be in the afternoon.
This is going to be an online event. Follow the link below to join the Zoom meeting. Please use your real name to join the meeting.
Title :The 49th Nankai Logic Colloquium -- Aristotelis Panagiotopoulos
Time :16:00pm, Mar. 29, 2024(Beijing Time)
Zoom Number : 734 242 5443
Passcode :477893
The records of past talks can be accessed at https://space.bilibili.com/253421893.
Best wishes,
Ming Xiao
Logic Seminar Talks 27 March 2024 and 3 April 2024 at NUS
UPDATE: This Week in Logic at CUNY
Rutgers Logic Seminar
Monday Mar 25, 3:30pm, Hill Center, Hill 705
Date: Monday, March 25, 4.15-6.15pm (NY time)
Room: Graduate Center Room 7395
Title: A moderate theory of overall resemblance
Abstract: This paper defends the moderate theory of overall resemblance stated by: A) y is at least as similar to x as z is iff: i) every resemblance property shared by x and z is also shared by x and y, and ii) for any resemblance family of properties F, y is at least as similar to x as z is with respect to F. In this account, a resemblance property is a property that corresponds to a genuine respect in which two things can resemble each other, whereas a resemblance family is a set of properties with respect to which things can be more or less similar to each other. An example of a resemblance property is being cubical, an example of a non-resemblance property is being either a gold cube or a silver sphere, and an example of a resemblance family is the set of specific mass properties.
- - - - Tuesday, Mar 26, 2024 - - - -
MOPA (Models of Peano Arithmetic)
CUNY Graduate Center
Virtual (email Victoria Gitman for meeting id)
Tuesday, March 26, 1pm
Roman Kossak, CUNY
The lattice problem for models of PA: Part ii
The lattice problem for models of PA is to determine which lattices can be represented either as lattices of elementary substructures of a model of PA or, more generally, which can be represented as lattices of elementary substructures of a model N that contain a given elementary substructure M of N. I will talk about the history of the problem, from the seminal paper of Haim Gaifman from 1976 and other early results to some recent work of Jim Schmerl. There is much to talk about.
Computational Logic Seminar
Spring 2024 (online)
Tuesday, March 26 Time 2:00 - 4:00 PM
zoom link: contact Sergei Artemov (sartemov@gmail.com)
Speaker: Thomas Studer, University of Bern
Title: Simplicial Complexes for Epistemic Logic
- - - - Wednesday, Mar 27, 2024 - - - -
- - - - Thursday, Mar 28, 2024 - - - -
- - - - Friday, Mar 29, 2024 - - - -
- - - - Monday, Apr 1, 2024 - - - -
Logic and Metaphysics Workshop
Date: Monday, April 1, 4.15-6.15pm (NY time)
Room: Graduate Center Room 7395
Andrew Tedder (Vienna).
Title: Relevant logics as topical logics
Abstract: There is a simple way of reading a structure of topics into the matrix models of a given logic, namely by taking the topics of a given matrix model to be represented by subalgebras of the algebra reduct of the matrix, and then considering assignments of subalgebras to formulas. The resulting topic-enriched matrix models bear suggestive similarities to the two-component frame models developed by Berto et. al. in Topics of Thought. In this talk I’ll show how this reading of topics can be applied to the relevant logic R, and its algebraic characterisation in terms of De Morgan monoids, and indicate how we can, using this machinery and the fact that R satisfies the variable sharing property, read R as a topic-sensitive logic. I’ll then suggest how this approach to modeling topics can be applied to a broader range of logics/classes of matrices, and gesture at some avenues of research.
- - - - Tuesday, Apr 2, 2024 - - - -
- - - - Wednesday, Apr 3, 2024 - - - -
- - - - Thursday, Apr 4, 2024 - - - -
- - - - Friday, Apr 5, 2024 - - - -
CUNY Graduate Center
Friday, April 5, 12:30pm NY time
Virtual: Please email Victoria Gitman (vgitman@gmail.com) for meeting id.
Kameryn Williams Bard College at Simon's Rock
Logic Workshop
CUNY Graduate Center
Friday April 5, 2:00pm-3:30pm, Room 5417
Decision problem for groups as equivalence relations
In 1911, Dehn proposed three decision problems for finitely presented groups: the word problem, the conjugacy problem, and the isomorphism problem. These problems have been central to both group theory and logic, and were each proven to be undecidable in the 50's. There is much current research studying the decidability of these problems in certain classes of groups.
Classically, when a decision problem is undecidable, its complexity is measured using Turing reducibility. However, Dehn's problems can also be naturally thought of as computably enumerable equivalence relations (ceers). We take this point of view and measure their complexity using computable reductions. This yields behaviors different from the classical context: for instance, every Turing degree contains a word problem, but not every ceer degree does. This leads us to study the structure of ceer degrees containing a word problem and other related questions.
Speakers:
Paul Baginski (Fairfield)
Artem Chernikov (Maryland)
Alf Dolich (CUNY)
Alexei Kolesnikov (Towson)
NEMTD 2024 sponsored by the Mid-Atlantic Mathematical Logic Seminar (NSF grant #DMS-1834219) and the Wesleyan Department of Mathematics and Computer Science.
Organizers: Alex Kruckman, Rehana Patel, Alex Van Abel. Contact akruckman@wesleyan.edu with any questions.
Find us on the web at: nylogic.github.io
(site designed, built & maintained by Victoria Gitman)
Set theory and topology seminar 26.03.2024 Tomasz Żuchowski
Tomasz Żuchowski
(on behalf of the organizers, i.e. Piotr Borodulin-Nadzieja, Paweł Krupski, Aleksandra Kwiatkowska, Grzegorz Plebanek, Robert Rałowski and myself)
About 15 minutes before the seminar we invite you for coffee and a chat to social room A.4.1.A in C-19.
https://settheory.pwr.edu.pl/
http://www.math.uni.wroc.pl/seminarium/topologia
This Week in Logic at CUNY
Rutgers Logic Seminar
Monday Mar 25, 3:30pm, Hill Center, Hill 705
Date: Monday, March 25, 4.15-6.15pm (NY time)
Room: Graduate Center Room 7395
Title: A moderate theory of overall resemblance
Abstract: This paper defends the moderate theory of overall resemblance stated by: A) y is at least as similar to x as z is iff: i) every resemblance property shared by x and z is also shared by x and y, and ii) for any resemblance family of properties F, y is at least as similar to x as z is with respect to F. In this account, a resemblance property is a property that corresponds to a genuine respect in which two things can resemble each other, whereas a resemblance family is a set of properties with respect to which things can be more or less similar to each other. An example of a resemblance property is being cubical, an example of a non-resemblance property is being either a gold cube or a silver sphere, and an example of a resemblance family is the set of specific mass properties.
- - - - Tuesday, Mar 26, 2024 - - - -
Computational Logic Seminar
Spring 2024 (online)
Tuesday, March 26 Time 2:00 - 4:00 PM
zoom link: contact Sergei Artemov (sartemov@gmail.com)
Speaker: Thomas Studer, University of Bern
Title: Simplicial Complexes for Epistemic Logic
- - - - Wednesday, Mar 27, 2024 - - - -
- - - - Thursday, Mar 28, 2024 - - - -
- - - - Friday, Mar 29, 2024 - - - -
- - - - Monday, Apr 1, 2024 - - - -
Logic and Metaphysics Workshop
Date: Monday, April 1, 4.15-6.15pm (NY time)
Room: Graduate Center Room 7395
Andrew Tedder (Vienna).
Title: Relevant logics as topical logics
Abstract: There is a simple way of reading a structure of topics into the matrix models of a given logic, namely by taking the topics of a given matrix model to be represented by subalgebras of the algebra reduct of the matrix, and then considering assignments of subalgebras to formulas. The resulting topic-enriched matrix models bear suggestive similarities to the two-component frame models developed by Berto et. al. in Topics of Thought. In this talk I’ll show how this reading of topics can be applied to the relevant logic R, and its algebraic characterisation in terms of De Morgan monoids, and indicate how we can, using this machinery and the fact that R satisfies the variable sharing property, read R as a topic-sensitive logic. I’ll then suggest how this approach to modeling topics can be applied to a broader range of logics/classes of matrices, and gesture at some avenues of research.
- - - - Tuesday, Apr 2, 2024 - - - -
- - - - Wednesday, Apr 3, 2024 - - - -
- - - - Thursday, Apr 4, 2024 - - - -
- - - - Friday, Apr 5, 2024 - - - -
CUNY Graduate Center
Friday, April 5, 12:30pm NY time
Virtual: Please email Victoria Gitman (vgitman@gmail.com) for meeting id.
Kameryn Williams Bard College at Simon's Rock
Logic Workshop
CUNY Graduate Center
Friday April 5, 2:00pm-3:30pm, Room 5417
Decision problem for groups as equivalence relations
In 1911, Dehn proposed three decision problems for finitely presented groups: the word problem, the conjugacy problem, and the isomorphism problem. These problems have been central to both group theory and logic, and were each proven to be undecidable in the 50's. There is much current research studying the decidability of these problems in certain classes of groups.
Classically, when a decision problem is undecidable, its complexity is measured using Turing reducibility. However, Dehn's problems can also be naturally thought of as computably enumerable equivalence relations (ceers). We take this point of view and measure their complexity using computable reductions. This yields behaviors different from the classical context: for instance, every Turing degree contains a word problem, but not every ceer degree does. This leads us to study the structure of ceer degrees containing a word problem and other related questions.
Speakers:
Paul Baginski (Fairfield)
Artem Chernikov (Maryland)
Alf Dolich (CUNY)
Alexei Kolesnikov (Towson)
NEMTD 2024 sponsored by the Mid-Atlantic Mathematical Logic Seminar (NSF grant #DMS-1834219) and the Wesleyan Department of Mathematics and Computer Science.
Organizers: Alex Kruckman, Rehana Patel, Alex Van Abel. Contact akruckman@wesleyan.edu with any questions.
Find us on the web at: nylogic.github.io
(site designed, built & maintained by Victoria Gitman)
Wednesday seminar
48th Nankai Logic Colloquium
Hello everyone,
This week our weekly Nankai Logic Colloquium is going to be in the afternoon.
This is going to be an online event. Follow the link below to join the Zoom meeting. Please use your real name to join the meeting.
Title :The 48th Nankai Logic Colloquium -- Dominique LecomteTime :16:00pm, Mar. 22, 2024(Beijing Time)
Zoom Number : 734 242 5443
Passcode :477893
Link :https://zoom.us/j/7342425443?pwd=NnO2EFts9VOfCR9eDFUkoI3lNn2QTo.1&omn=87996387829
_____________________________________________________________________
The records of past talks can be accessed at https://space.bilibili.com/253421893.
Best wishes,
Ming Xiao
Logic Seminar 20 March 2024 17:00 hrs by Sun Mengzhou
This Week in Logic at CUNY
Logic and Metaphysics Workshop
Date: Monday, March 18, 4.15-6.15pm (NY time)
Room: Graduate Center Room 7395
Title: Modal quantifiers, potential infinity, and Yablo sequences
Abstract: When properly arithmetized, Yablo’s paradox results in a set of formulas which (with local disquotation in the background) turns out to be consistent, but omega-inconsistent. Adding either uniform disquotation or the omega-rule results in inconsistency. Since the paradox involves an infinite sequence of sentences, one might think that it doesn’t arise in finitary contexts. We study whether it does. It turns out that the issue depends on how the finitistic approach is formalized. On one of them, proposed by Marcin Mostowski, all the paradoxical sentences simply fail to hold. This happens at a price: the underlying finitistic arithmetic itself is omega-inconsistent. Finally, when studied in the context of a finitistic approach which preserves the truth of standard arithmetic, the paradox strikes back — it does so with double force, for now the inconsistency can be obtained without the use of uniform disquotation or the omega-rule.
Note: This is joint work with Rafał Urbaniak (Gdańsk).
- - - - Tuesday, Mar 19, 2024 - - - -
Roman Kossak, CUNY
The lattice problem for models of PA
The lattice problem for models of PA is to determine which lattices can be represented either as lattices of elementary substructures of a model of PA or, more generally, which can be represented as lattices of elementary substructures of a model N that contain a given elementary substructure M of N. I will talk about the history of the problem, from the seminal paper of Haim Gaifman from 1976 and other early results to some recent work of Jim Schmerl. There is much to talk about.
Spring 2024 (online)
Title: Logics of Intuitionistic Knowledge and Verification
The New York City Category Theory Seminar
Department of Computer Science
Department of Mathematics
The Graduate Center of The City University of New York
URL: http://www.sci.brooklyn.cuny.edu/~noson/Seminar/index.html
Speaker: Sina Hazratpour, Johns Hopkins University.
Date and Time: Wednesday March 20, 2024, 7:00 - 8:30 PM.
Title: Fibred Categories in Lean.
Abstract: Fibred categories are one of the most important and useful concepts in category theory and its application in categorical logic. In this talk I present my recent formalization of fibred categories in the interactive theorem prover Lean 4. I begin by highlighting certain technical challenges associated with handling the equality of objects and functors within the extensional dependent type system of Lean, and how they can be overcome. In this direction, I will demonstrate how we can take advantage of dependent coercion, instance synthesis, and automation tactics from the Lean toolbox. Finally I will discuss a formalization of Homotopy Type Theory in Lean 4 using a fired categorical framework.
- - - - Thursday, Mar 21, 2024 - - - -
- - - - Friday, Mar 22, 2024 - - - -
CUNY Graduate Center
Friday, March 22, 12:30pm NY time
Virtual: Please email Victoria Gitman (vgitman@gmail.com) for meeting id.
Arthur Apter, CUNY
A choiceless answer to a question of Woodin
In a lecture presented in July 2023, Moti Gitik discussed the following question from the 1980s due to Woodin, as well as approaches to its solution and why it is so difficult to solve:
Question: Assuming there is no inner model of ZFC with a strong cardinal, is it possible to have a model of ZFC such that ' and for every ', together with the existence of an inner model of ZFC such that for the so that and ' is measurable and '?I will discuss how to find answers to this question, if we drop the requirement that satisfies the Axiom of Choice. I will also briefly discuss the phenomenon that on occasion, when the Axiom of Choice is removed from consideration, a technically challenging question or problem becomes more tractable. One may, however, end up with models satisfying conclusions that are impossible in ZFC.
Reference: A. Apter, 'A Note on a Question of Woodin', Bulletin of the Polish Academy of Sciences (Mathematics), volume 71(2), 2023, 115--121.
CUNY Graduate Center
Mediate cardinals
In the late 1910s Bertrand Russell was occupied with two things: getting into political trouble for his pacifism and trying to understand the foundations of mathematics. His students were hard at work with him on this second occupation. One of those students was Dorothy Wrinch. In 1923 she gave a characterization of the axiom of choice in terms of a generalization of the notion of a Dedekind-finite infinite set. Unfortunately, her career turned toward mathematical biology and her logical work was forgotten by history.
This talk is part of a project of revisiting Wrinch's work from a modern perspective. I will present the main result of her 1923 paper, that AC is equivalent to the non-existence of what she termed mediate cardinals. I will also talk about some new independence results. The two main results are: (1) the smallest for which a -mediate cardinal exists can consistently be any regular and (2) the collection of regular for which exact -mediate cardinals exist can consistently be any class.
- - - - Monday, Mar 25, 2024 - - - -
Logic and Metaphysics Workshop
Date: Monday, March 25, 4.15-6.15pm (NY time)
Room: Graduate Center Room 7395
Title: A moderate theory of overall resemblance
Abstract: This paper defends the moderate theory of overall resemblance stated by: A) y is at least as similar to x as z is iff: i) every resemblance property shared by x and z is also shared by x and y, and ii) for any resemblance family of properties F, y is at least as similar to x as z is with respect to F. In this account, a resemblance property is a property that corresponds to a genuine respect in which two things can resemble each other, whereas a resemblance family is a set of properties with respect to which things can be more or less similar to each other. An example of a resemblance property is being cubical, an example of a non-resemblance property is being either a gold cube or a silver sphere, and an example of a resemblance family is the set of specific mass properties.
- - - - Tuesday, Mar 26, 2024 - - - -
- - - - Wednesday, Mar 27, 2024 - - - -
- - - - Thursday, Mar 28, 2024 - - - -
- - - - Friday, Mar 29, 2024 - - - -
WHERE: Rutgers, The State University of New Jersey.
WHEN: Saturday, March 23
Find us on the web at: nylogic.github.io
(site designed, built & maintained by Victoria Gitman)
KGRC Talk - March 21
Set theory and topology seminar 19.03.2024 Piotr Szewczak
Piotr Szewczak (UKSW)
(on behalf of the organizers, i.e. Piotr Borodulin-Nadzieja, Paweł Krupski, Aleksandra Kwiatkowska, Grzegorz Plebanek, Robert Rałowski and myself)
About 15 minutes before the seminar we invite you for coffee and a chat to social room A.4.1.A in C-19.
https://settheory.pwr.edu.pl/
http://www.math.uni.wroc.pl/seminarium/topologia
Wednesday seminar
47th Nankai Logic Colloquium
Hello everyone,
This week our weekly Nankai Logic Colloquium is going to be in the morning.
Our speaker this week will be Sumun Iyer from Cornell University. This talk is going to take place this Friday, Mar 15, from 9am to 10am(UTC+8, Beijing time).
This is going to be an online event. Follow the link below to join the Zoom meeting. Please use your real name to join the meeting.
Title :The 47th Nankai Logic Colloquium -- Sumun Iyer
Time :9:00am, Mar. 15, 2024(Beijing Time)
Zoom Number : 734 242 5443
Passcode :477893
Link :https://zoom.us/j/7342425443?pwd=EG6I3uatr8anqkk6HM5wZ9FKjhkjbC.1&omn=87197636384
_____________________________________________________________________
Best wishes,
Ming Xiao
This Week in Logic at CUNY
Logic and Metaphysics Workshop
Date: Monday, March 11, 4.15-6.15pm (NY time)
Room: Graduate Center Room 7395
Title: Dispensing with the grounds of logical necessity
Abstract: Logical laws are typically conceived as being necessary. But in virtue of what is this the case? That is, what are the grounds of logical necessity? In this paper, I examine four different answers to this question in terms of: truth-conditions, invariance of truth-values under different interpretations, possible worlds, and brute facts. I ultimately find all of them wanting. I conclude that an alternative conception of logic that dispenses altogether with grounds of logical necessity provides a less troublesome alternative. I then indicate some of the central features of this conception.
- - - - Tuesday, Mar 12, 2024 - - - -
Albert Visser, Utrecht University
Restricted completions
This talk reports on research in collaboration with Ali Enayat and Mateusz Łełyk.
Steffen Lempp and Dino Rossegger asked: is there a consistent completion of that is axiomatised by sentences of bounded quantifier-alternation complexity? We show that there is no such restricted completion. We also show that, if one changes the measure of complexity to being , there is a restricted completion. Specifically, we show that the true theory of the non-negative part of can be axiomatised by a single sentence plus a set of -sentences.In our talk we will sketch these two answers. One of our aims is to make clear is that the negative answer for the case of quantifier-alternation complexity simply follows from Rosser's Theorem viewed from a sufficiently abstract standpoint.
- - - - Wednesday, Mar 13, 2024 - - - -
- - - - Thursday, Mar 14, 2024 - - - -
- - - - Friday, Mar 15, 2024 - - - -
CUNY Graduate Center
Friday, March 15, 12:30pm NY time
Virtual: Please email Victoria Gitman (vgitman@gmail.com) for meeting id.
Squares, ultrafilters and forcing axioms
A uniform ultrafilter over a cardinal is called indecomposable if, whenever and , there is a set such that is countable. Indecomposability is a natural weakening of -completeness and has a number of implications for, e.g., the structure of ultraproducts. In the 1980s, Sheard answered a question of Silver by proving the consistency of the existence of an inaccessible but not weakly compact cardinal carrying an indecomposable ultrafilter. Recently, however, Goldberg proved that this situation cannot hold above a strongly compact cardinal: If is strongly compact and carries an indecomposable ultrafilter, then is either measurable or a singular limit of countably many measurable cardinals. We prove that the same conclusion follows from the Proper Forcing Axiom, thus adding to the long list of statements first shown to hold above a strongly compact or supercompact cardinal and later shown also to follow from PFA. Time permitting, we will employ certain indexed square principles to prove that our results are sharp. This is joint work with Assaf Rinot and Jing Zhang.
CUNY Graduate Center
Tennebaum's Theorem for quotient presentations and model-theoretic skepticism
A computable quotient presentation of a mathematical structure consists of a computable structure on the natural numbers , meaning that the operations and relations of the structure are computable, and an equivalence relation on , not necessarily computable but which is a congruence with respect to this structure, such that the quotient is isomorphic to the given structure . Thus, one may consider computable quotient presentations of graphs, groups, orders, rings and so on.
A natural question asked by B. Khoussainov in 2016, is if the Tennenbaum Thoerem extends to the context of computable presentations of nonstandard models of arithmetic. In a joint work with J.D. Hamkins we have proved that no nonstandard model of arithmetic admits a computable quotient presentation by a computably enumerable equivalence relation on the natural numbers.
However, as it happens, there exists a nonstandard model of arithmetic admitting a computable quotient presentation by a co-c.e. equivalence relation. Actually, there are infinitely many of those. The idea of the proof consists is simulating the Henkin construction via finite injury priority argument. What is quite surprising, the construction works (i.e. injury lemma holds) by Hilbert's Basis Theorem. The latter argument is joint work with T. Slaman and L. Harrington.
- - - - Monday, Mar 18, 2024 - - - -
Logic and Metaphysics Workshop
Date: Monday, March 18, 4.15-6.15pm (NY time)
Room: Graduate Center Room 7395
Title: Modal quantifiers, potential infinity, and Yablo sequences
Abstract: When properly arithmetized, Yablo’s paradox results in a set of formulas which (with local disquotation in the background) turns out to be consistent, but omega-inconsistent. Adding either uniform disquotation or the omega-rule results in inconsistency. Since the paradox involves an infinite sequence of sentences, one might think that it doesn’t arise in finitary contexts. We study whether it does. It turns out that the issue depends on how the finitistic approach is formalized. On one of them, proposed by Marcin Mostowski, all the paradoxical sentences simply fail to hold. This happens at a price: the underlying finitistic arithmetic itself is omega-inconsistent. Finally, when studied in the context of a finitistic approach which preserves the truth of standard arithmetic, the paradox strikes back — it does so with double force, for now the inconsistency can be obtained without the use of uniform disquotation or the omega-rule.
Note: This is joint work with Rafał Urbaniak (Gdańsk).
- - - - Tuesday, Mar 19, 2024 - - - -
- - - - Wednesday, Mar 20, 2024 - - - -
The New York City Category Theory Seminar
Department of Computer Science
Department of Mathematics
The Graduate Center of The City University of New York
URL: http://www.sci.brooklyn.cuny.edu/~noson/Seminar/index.html
Speaker: Sina Hazratpour, Johns Hopkins University.
Date and Time: Wednesday March 20, 2024, 7:00 - 8:30 PM.
Title: Fibred Categories in Lean.
Abstract: Fibred categories are one of the most important and useful concepts in category theory and its application in categorical logic. In this talk I present my recent formalization of fibred categories in the interactive theorem prover Lean 4. I begin by highlighting certain technical challenges associated with handling the equality of objects and functors within the extensional dependent type system of Lean, and how they can be overcome. In this direction, I will demonstrate how we can take advantage of dependent coercion, instance synthesis, and automation tactics from the Lean toolbox. Finally I will discuss a formalization of Homotopy Type Theory in Lean 4 using a fired categorical framework.
- - - - Thursday, Mar 21, 2024 - - - -
- - - - Friday, Mar 22, 2024 - - - -
CUNY Graduate Center
Friday, March 22, 12:30pm NY time
Virtual: Please email Victoria Gitman (vgitman@gmail.com) for meeting id.
Arthur Apter, CUNY
A choiceless answer to a question of Woodin
In a lecture presented in July 2023, Moti Gitik discussed the following question from the 1980s due to Woodin, as well as approaches to its solution and why it is so difficult to solve:
Question: Assuming there is no inner model of ZFC with a strong cardinal, is it possible to have a model of ZFC such that ' and for every ', together with the existence of an inner model of ZFC such that for the so that and ' is measurable and '?I will discuss how to find answers to this question, if we drop the requirement that satisfies the Axiom of Choice. I will also briefly discuss the phenomenon that on occasion, when the Axiom of Choice is removed from consideration, a technically challenging question or problem becomes more tractable. One may, however, end up with models satisfying conclusions that are impossible in ZFC.
Reference: A. Apter, 'A Note on a Question of Woodin', Bulletin of the Polish Academy of Sciences (Mathematics), volume 71(2), 2023, 115--121.
CUNY Graduate Center
WHERE: Rutgers, The State University of New Jersey.
WHEN: Saturday, March 23
Find us on the web at: nylogic.github.io
(site designed, built & maintained by Victoria Gitman)
-------- ADMINISTRIVIA --------
To subscribe/unsubscribe to this list, please email your request to jreitz@citytech.cuny.edu.
If you have a logic-related event that you would like included in future mailings, please email jreitz@citytech.cuny.edu.
KGRC Talks - March 11-15
Set theory and topology seminar 12.03.2024 Grigor Sargsyan
Grigor Sargsyan (IMPAN)
(on behalf of the organizers, i.e. Piotr Borodulin-Nadzieja, Paweł Krupski, Aleksandra Kwiatkowska, Grzegorz Plebanek, Robert Rałowski and myself)
About 15 minutes before the seminar we invite you for coffee and a chat to social room A.4.1.A in C-19.
https://settheory.pwr.edu.pl/
http://www.math.uni.wroc.pl/seminarium/topologia
Wednesday seminar
KGRC Set Theory Talks - March 4-8
Alexi Block Gorman, Ohio State University, Columbus, US (host: Matthias Aschenbrenner) visits March 3–9
Elliot Kaplan, McMaster University, Hamilton, CA, Columbus, US (host: Nigel Pynn-Coates) visits March 3–9
Silvan Horvath, ETH Zurich, CH (host: Vera Fischer) visits March 4–July 31
* * * * * * * * *
KGRC/Institute of Mathematics invites you to the following talks:
(updates at https://kgrc.univie.ac.at/) )
SET THEORY SEMINAR
Kolingasse 14–16, 1090, 1st floor, SR 10,
Thursday, March 7, 11:30am – 12:00pm, hybrid mode
”Magic Sets”
S. Horvath (ETH Zurich, CH)
A Magic Set is a set M of reals with the property that for all nowhere constant, continuous functions f and
g on the reals it holds that f [M ] ⊆ g[M ] implies f = g.
I will cover some of the basic results on magic sets and introduce magic forcing - a forcing notion that adds
a new magic set to the ground model.
Zoom: If you have not received the Zoom data by the day before the talk, please contact petra.czarnecki@univie.ac.at.
Meeting ID: 671 1734 6051
Passcode: kgrc
Please direct any questions about this talk to vera.fischer@univie.ac.at.
* * * * * * * * *
SET THEORY SEMINAR
Kolingasse 14–16, 1090, 1st floor, SR 10,
Thursday, March 7, 12:00pm – 13:00pm, hybrid mode
”A general theory of iterated forcing using finitely additive measures”
A. F. Uribe Zapata (TU Wien)
Saharon Shelah in 2000 introduced a finite-support iteration using finitely additive measures to prove that,
consistently, the covering of the null ideal may have countable cofinality. In 2019, Jakob Kellner, Saharon
Shelah, and Anda R. T ̆anasie achieved some new results and applications using such iterations.
In this talk, based on the works mentioned above, we present a general theory of iterated forcing using
finitely additive measures, which was developed in the speaker’s master’s thesis. For this purpose, we intro-
duce two new notions: on the one hand, we define a new linkedness property, which we call ”FAM-linked”
and, on the other hand, we generalize the idea of intersection number to forcing notions, which justifies the
limit steps of our iteration theory. Finally, we show a new separation of the left-side of Cicho ́n’s diagram
allowing a singular value.
Zoom info
Zoom: If you have not received the Zoom data by the day before the talk, please contact petra.czarnecki@univie.ac.at.
Passcode: kgrc
Please direct any questions about this talk to vera.fischer@univie.ac.at.
* * * * * * * * *
VIDEO recordings available so far of the LOGIC COLLOQUIUM:
January 25: Y. Khomskii (Amsterdam U College, NL and U Hamburg, DE) "Trees, Transcendence and Quasi-generic reals"https://ucloud.univie.ac.at/index.php/s/Wd9DPzXqQsnBPzC
November 16: D. A. Mejía (Shizuoka U, JP) ”Iterations with ultrafilter-limits and fam-limits” https://ucloud.univie.ac.at/index.php/s/T6pD2XgwTfNPYtn
—–
The LECTURE NOTE for Diego Mejía’s mini-course available so far of the Set Theory Seminar:
January 25: D. A. Mejıa (Shizuoka U, JP) ”Forcing techniques for Cicho ́n’s Maximum” https://mathematik.univie.ac.at/fileadmin/user_upload/f_mathematik/Events_News/Vortraege_Events/2023-24/20240122_Mejia_minicourse-1.pdf.
VIDEO recordings available so far of the SET THEORY SEMINAR:
January 25: D. A. Mejía (Shizuoka U, JP), ”Forcing techniques for Cicho ́n’s Maximum VI” video: https://ucloud.univie.ac.at/index.php/s/8EyKfLZW3NBH4f2
January 18: D. A. Mejía (Shizuoka U, JP), ”Forcing techniques for Cicho ́n’s Maximum V” video:https://ucloud.univie.ac.at/index.php/s/QrKjY6CYtJMx7WT
January 11: D. A. Mejía (Shizuoka U, JP), ”Forcing techniques for Cicho ́n’s Maximum IV” https://ucloud.univie.ac.at/index.php/s/KFpbqsLjQm3tcKn
December 7: "Forcing techniques for Cichoń's Maximum: FS iterations II" video:https://ucloud.univie.ac.at/index.php/s/iwqKFiYCEpPaPsN
November 30: "Forcing techniques for Cichoń's Maximum I" video: https://ucloud.univie.ac.at/index.php/s/xWjSe9eA92ReRV9
-- Mag. Petra Czarnecki de Czarnce-Chalupa Institute of Mathematics (Kurt Goedel Research Center, Logic) University of Vienna Kolingasse 14-16, #7.48 1090 Vienna, Austria Phone: +43/ (0)1 4277-50501
NUS Logic Seminar Talk by Rupert Hoelzl on 6 March 2024 17:00 hrs
Set theory and topology seminar 5.03.2024 Agnieszka Widz
Agnieszka Widz
(on behalf of the organizers, i.e. Piotr Borodulin-Nadzieja, Paweł Krupski, Aleksandra Kwiatkowska, Grzegorz Plebanek, Robert Rałowski and myself)
About 15 minutes before the seminar we invite you for coffee and a chat to social room A.4.1.A in C-19.
https://settheory.pwr.edu.pl/
http://www.math.uni.wroc.pl/seminarium/topologia
This Week in Logic at CUNY
Rutgers Logic Seminar
Monday, March 4, 3:30pm, Rutgers University, Hill 705
Logic and Metaphysics Workshop
Date: Monday, March 4, 4.15-6.15pm (NY time)
Room: Graduate Center Room 7395
Elise Crull (CUNY).
Title: Declaring no dependence
Abstract: Viable fundamental ontologies require at least one suitably stable, generic-yet-toothy metaphysical dependence relation to establish fundamentality. In this talk I argue that recent experiments in quantum physics using Page-Wootters devices to model global vs. local dynamics cast serious doubt on the existence of such metaphysical dependence relations when – and arguably, inevitably within any ontological framework – physical systems serve as the relata.
- - - - Tuesday, Mar 5, 2024 - - - -
Tightness and solidity in fragments of Peano Arithmetic
It was shown by Visser that Peano Arithmetic has the property that no two distinct extensions of it (in its language) are bi-interpretable. Enayat proposed to refer to this property of a theory as tightness and to carry out a more systematic study of tightness and its stronger variants, which he called neatness and solidity.
Enayat proved that not only , but also , , and are solid; and on the other hand, that finitely axiomatisable fragments of them are not even tight. Later work by a number of authors showed that many natural proper fragments of these theories are also not tight.
Enayat asked whether there are proper solid subtheories (containing some basic axioms that depend on the theory) of the theories listed above. We answer this question in the case of by proving that for every there exists a solid theory strictly between and . Furthermore, we can require that the theory does not interpret , and that if any true arithmetic sentence is added to it, the theory still does not prove .
Joint work with Leszek Kołodziejczyk and Mateusz Łełyk.
Spring 2024 (online) For a zoom link contact S.Artemov
Tuesday, March 5, Time 2:00 - 4:00 PM
Speaker: Sergei Artemov, Graduate Center
Title: On Tolerance Analysis in Extensive-Form Games.
- - - - Wednesday, Mar 6, 2024 - - - -
The New York City Category Theory Seminar
Department of Computer Science
Department of Mathematics
The Graduate Center of The City University of New York
URL: http://www.sci.brooklyn.cuny.edu/~noson/Seminar/index.html
Speaker: Jean-Pierre Marquis, Universite de Montreal.
Date and Time: Wednesday March 6, 2024, 7:00 - 8:30 PM. IN PERSON TALK!
Title: Hom sweet Hom: a sketch of the history of duality in category theory.
Abstract: Duality, in its various forms and roles, played a surprisingly important part in the development of category theory. In this talk, I will concentrate on the development of these forms and roles that lead to the categorical formulation of Stone-type dualities in the 1970s. I will emphasize the epistemological gain and loss along the way.
- - - - Thursday, Mar 7, 2024 - - - -
- - - - Friday, Mar 8, 2024 - - - -
CUNY Graduate Center
Friday, March 8, 12:30pm NY time
Virtual: Please email Victoria Gitman (vgitman@gmail.com) for meeting id.
- - - - Monday, Mar 11, 2024 - - - -
Logic and Metaphysics Workshop
Date: Monday, March 11, 4.15-6.15pm (NY time)
Room: Graduate Center Room 7395
Title: Dispensing with the grounds of logical necessity
Abstract: Logical laws are typically conceived as being necessary. But in virtue of what is this the case? That is, what are the grounds of logical necessity? In this paper, I examine four different answers to this question in terms of: truth-conditions, invariance of truth-values under different interpretations, possible worlds, and brute facts. I ultimately find all of them wanting. I conclude that an alternative conception of logic that dispenses altogether with grounds of logical necessity provides a less troublesome alternative. I then indicate some of the central features of this conception.
- - - - Tuesday, Mar 12, 2024 - - - -
Albert Visser, Utrecht University
Restricted completions
This talk reports on research in collaboration with Ali Enayat and Mateusz Łełyk.
Steffen Lempp and Dino Rossegger asked: is there a consistent completion of that is axiomatised by sentences of bounded quantifier-alternation complexity? We show that there is no such restricted completion. We also show that, if one changes the measure of complexity to being , there is a restricted completion. Specifically, we show that the true theory of the non-negative part of can be axiomatised by a single sentence plus a set of -sentences.In our talk we will sketch these two answers. One of our aims is to make clear is that the negative answer for the case of quantifier-alternation complexity simply follows from Rosser's Theorem viewed from a sufficiently abstract standpoint.
- - - - Wednesday, Mar 13, 2024 - - - -
- - - - Thursday, Mar 14, 2024 - - - -
- - - - Friday, Mar 15, 2024 - - - -
CUNY Graduate Center
Friday, March 15, 12:30pm NY time
Virtual: Please email Victoria Gitman (vgitman@gmail.com) for meeting id.
CUNY Graduate Center
WHERE: Rutgers, The State University of New Jersey.
WHEN: Saturday, March 23
Find us on the web at: nylogic.github.io
(site designed, built & maintained by Victoria Gitman)
-------- ADMINISTRIVIA --------
To subscribe/unsubscribe to this list, please email your request to jreitz@citytech.cuny.edu.
If you have a logic-related event that you would like included in future mailings, please email jreitz@citytech.cuny.edu.
Wednesday seminar
Wednesday seminar
45th Nankai Logic Colloquium
Hello everyone,
Our speaker this week will be Takayuki Kihara from Nagoya University. This talk is going to take place this Friday, Mar. 01, from 4pm to 5pm(UTC+8, Beijing time).
[Title]
On the Wadge degrees of Borel partitions
[Abstract]
In descriptive set theory, there are a lot of semi-well-ordered hierarchies, such as the Borel hierarchy, the projective hierarchy, and the difference hierarchy. Under AD, their ultimate refinement is provided by the Wadge degrees, which is also semi-well-ordered.
Now, the question arises: what exactly gives rise to this semi-well-ordered structure?
Our goal is to reveal the true structure behind this semi-well-order. To achieve this, it is crucial to handle not subsets (two-valued functions) but partitions (k-valued functions). As long as we only observe two-valued functions, all dynamic mechanisms lurking behind collapse, appearing to our eyes only as a semi-well-order. By dealing with partitions, we can expose the ultimate dynamic structure that was concealed. What existed there is not a semi-well-order but rather a better quasi-order, -- a sort of transfinite "matryoshkas" of trees.
The records of past talks can be accessed at https://space.bilibili.com/253421893.
Best Wishes,
Ming Xiao
Cross-Alps Logic Seminar (speaker: Simon Henry)
This Week in Logic at CUNY
Logic and Metaphysics Workshop
Date: Monday, Feb 26, 4.15-6.15pm (NY time)
Room: Graduate Center Room 7395
Matteo Plebani (Turin).
Title: Semantic paradoxes as collective tragedies
Abstract: What does it mean to solve a paradox? A common assumption is that to solve a paradox we need to find the wrong step in a certain piece of reasoning. In this talk, I will argue while in the case of some paradoxes such an assumption might be correct, in the case of paradoxes such as the liar and Curry’s paradox it can be questioned.
- - - - Tuesday, Feb 27, 2024 - - - -
Computational Logic Seminar
Spring 2024 (online)
Tuesday, February 27, 2:00 - 4:00 PM
For a ZOOM link contact Sergei Artemov (sartemov@gc.cuny.edu)
Speaker: Vincent Peluce, Graduate Center
Title: What is Intuitionistic Arithmetic
- - - - Wednesday, Feb 28, 2024 - - - -
The New York City Category Theory Seminar
Department of Computer Science
Department of Mathematics
The Graduate Center of The City University of New York
URL: http://www.sci.brooklyn.cuny.edu/~noson/Seminar/index.html
- - - - Thursday, Feb 29, 2024 - - - -
- - - - Friday, Mar 1, 2024 - - - -
CUNY Graduate Center
Rehana Patel Wesleyan University
CUNY Graduate Center
Alf Dolich, CUNY
Component Closed Structures on the Reals
A structure, R, expanding is called component closed if whenever is definable so are all of 's connected components. Two basic examples of component closed structures are and . It turns out that these two structures are exemplary of a general phenomenon for component closed structures from a broad class of expansions of : either their definable sets are very 'tame' (as in the case of the real closed field) or they are quite 'wild' (as in the case of the real field expanded by the integers).
- - - - Monday, Mar 4, 2024 - - - -
Rutgers Logic Seminar
Monday, March 4, 3:30pm, Rutgers University, Hill 705
Logic and Metaphysics Workshop
Date: Monday, March 4, 4.15-6.15pm (NY time)
Room: Graduate Center Room 7395
Elise Crull (CUNY).
Title: Declaring no dependence
Abstract: Viable fundamental ontologies require at least one suitably stable, generic-yet-toothy metaphysical dependence relation to establish fundamentality. In this talk I argue that recent experiments in quantum physics using Page-Wootters devices to model global vs. local dynamics cast serious doubt on the existence of such metaphysical dependence relations when – and arguably, inevitably within any ontological framework – physical systems serve as the relata.
- - - - Tuesday, Mar 5, 2024 - - - -
- - - - Wednesday, Mar 6, 2024 - - - -
The New York City Category Theory Seminar
Department of Computer Science
Department of Mathematics
The Graduate Center of The City University of New York
URL: http://www.sci.brooklyn.cuny.edu/~noson/Seminar/index.html
Speaker: Jean-Pierre Marquis, Universite de Montreal.
Date and Time: Wednesday March 6, 2024, 7:00 - 8:30 PM. IN PERSON TALK!
Title: Hom sweet Hom: a sketch of the history of duality in category theory.
Abstract: Duality, in its various forms and roles, played a surprisingly important part in the development of category theory. In this talk, I will concentrate on the development of these forms and roles that lead to the categorical formulation of Stone-type dualities in the 1970s. I will emphasize the epistemological gain and loss along the way.
- - - - Thursday, Mar 7, 2024 - - - -
- - - - Friday, Mar 8, 2024 - - - -
CUNY Graduate Center
Friday, March 8, 12:30pm NY time
Virtual: Please email Victoria Gitman (vgitman@gmail.com) for meeting id.
WHERE: Rutgers, The State University of New Jersey.
WHEN: Saturday, March 23
Find us on the web at: nylogic.github.io
(site designed, built & maintained by Victoria Gitman)
-------- ADMINISTRIVIA --------
To subscribe/unsubscribe to this list, please email your request to jreitz@citytech.cuny.edu.
If you have a logic-related event that you would like included in future mailings, please email jreitz@citytech.cuny.edu.
Wednesday seminar
44th Nankai Logic Colloquium
Hello everyone,
Our speaker this week will be Clark Lyons from the University of California, Los Angeles. This talk is going to take place this Friday, Feb 23, from 9am to 10am(UTC+8, Beijing time).
Title: Baire Measurable Matchings in Non-amenable Graphs Abstract: Tutte's theorem provides a necessary and sufficient condition for a finite graph to have a perfect matching. In this talk I will present joint work with Kastner showing that if a locally finite Borel graph satisfies a strengthened form of Tutte's condition, then it has a perfect matching which is Baire measurable. As a consequence, the Schreier graph of a free action of a non-amenable group on a Polish space admits a Baire measurable perfect matching. This is analogous to the result of Csoka and Lippner on factor of IID perfect matchings for non-amenable Cayley graphs.
The records of past talks can be accessed at https://space.bilibili.com/253421893.
Best Wishes,
Ming Xiao
Set theory and topology seminar 27.02.2024 Grzegorz Plebanek
Grzegorz Plebanek
(on behalf of the organizers, i.e. Piotr Borodulin-Nadzieja, Paweł Krupski, Aleksandra Kwiatkowska, Grzegorz Plebanek, Robert Rałowski and myself)
About 15 minutes before the seminar we invite you for coffee and a chat to social room A.4.1.A in C-19.
https://settheory.pwr.edu.pl/
http://www.math.uni.wroc.pl/seminarium/topologia
Wednesday seminar
This Week in Logic at CUNY
Rutgers Logic Seminar
Monday, Feb 19, 3:30pm, Rutgers University, Hill 705
Artem Chernikov, Maryland
Intersecting sets in probability spaces and Shelah's classification
- - - - Tuesday, Feb 20, 2024 - - - -
Spring 2024 (online)
Title: Counterpossibles in relative computability theory: a closer look
HT If the validity problem were algorithmically solvable, then arithmetical truth would be also algorithmically decidable
As Jenny himself emphasizes, establishing that HT is a false counterpossible would be highly significant. According to the standard analysis of counterfactuals ([Lewis, 1973], [Stalnaker, 1968]) all counterpossibles are vacuously true. If HT is false, then, the standard analysis of counterfactuals is wrong.
In this paper, we will argue that HT admits two readings, which are expressed by two different ways of formalizing HT. Under the first reading, HT is clearly a counterpossible. Under the second reading, HT is clearly false. Hence, it is possible to read HT as a counterpossible (section 2) and it is possible to read HT as a false claim (section 3). However, it is unclear that it is possible to do both things at once, i.e. interpret HT as a false counterpossible.
It can be proven that the two readings are not equivalent. The formalization expressing the first reading is a mathematical theorem, which means that under the first reading, HT is a true counterpossible. On the other hand, I will argue that under the second reading HT, while false, is best interpreted as a counterpossible with a contingent antecedent.
- - - - Wednesday, Feb 21, 2024 - - - -
- - - - Thursday, Feb 22, 2024 - - - -
- - - - Friday, Feb 23, 2024 - - - -
CUNY Graduate Center
- - - - Monday, Feb 26, 2024 - - - -
Logic and Metaphysics Workshop
Date: Monday, Feb 26, 4.15-6.15pm (NY time)
Room: Graduate Center Room 7395
Matteo Plebani (Turin).
Title: Semantic paradoxes as collective tragedies
Abstract: What does it mean to solve a paradox? A common assumption is that to solve a paradox we need to find the wrong step in a certain piece of reasoning. In this talk, I will argue while in the case of some paradoxes such an assumption might be correct, in the case of paradoxes such as the liar and Curry’s paradox it can be questioned.
- - - - Tuesday, Feb 27, 2024 - - - -
- - - - Wednesday, Feb 28, 2024 - - - -
The New York City Category Theory Seminar
Department of Computer Science
Department of Mathematics
The Graduate Center of The City University of New York
URL: http://www.sci.brooklyn.cuny.edu/~noson/Seminar/index.html
In this talk, we will construct semi-simplicial types in Displayed Type Theory [dTT], a fully semantically general homotopy type theory. Many of our main results are independent of type theory and will say something new and surprising about the homotopy theoretic notion of a classifier for semi-simplicial objects.
This talk is based on joint work with Michael Shulman. Reference: https://arxiv.org/abs/2311.18781
- - - - Thursday, Feb 29, 2024 - - - -
- - - - Friday, Mar 1, 2024 - - - -
CUNY Graduate Center
Rehana Patel Wesleyan University
CUNY Graduate Center
Alf Dolich, CUNY
Component Closed Structures on the Reals
A structure, R, expanding is called component closed if whenever is definable so are all of 's connected components. Two basic examples of component closed structures are and . It turns out that these two structures are exemplary of a general phenomenon for component closed structures from a broad class of expansions of : either their definable sets are very 'tame' (as in the case of the real closed field) or they are quite 'wild' (as in the case of the real field expanded by the integers).
WHERE: Rutgers, The State University of New Jersey.
WHEN: Saturday, March 23
Find us on the web at: nylogic.github.io
(site designed, built & maintained by Victoria Gitman)
-------- ADMINISTRIVIA --------
To subscribe/unsubscribe to this list, please email your request to jreitz@citytech.cuny.edu.
If you have a logic-related event that you would like included in future mailings, please email jreitz@citytech.cuny.edu.
Logic Seminar Wed 21.02.2024 17:00 hrs at NUS by Neil Barton
This Week in Logic at CUNY
Rutgers Logic Seminar
Monday, Feb 12, 3:30pm, Rutgers University, Hill 705
For a cardinal $\kappa\ge 2$, one can weaken the classical concept "x is ordinal definable" (i.e., x is the unique object satisfying some condition involving ordinal parameters) to "x is <$\kappa$-blurrily ordinal definable," meaning that x is one of fewer than $\kappa$ many objects satisfying some condition involving ordinal parameters. By considering the hereditary version of this, one naturally arrives at the inner model <$\kappa$-HOD, the class of all hereditarily <$\kappa$-blurrily ordinal definable sets. In ZFC, by varying $\kappa$, one obtains a hierarchy of inner models spanning the entire spectrum from HOD to V. Those stages in the hierarchy where something new is added I call leaps.
I will give an overview of what is known about this hierarchy: ZFC-provable facts regarding the relationships between the stages of the hierarchy and the basic structure of leaps, and consistency results on leap constellations, including consistency strength determinations.
- - - - Tuesday, Feb 13, 2024 - - - -
MOPA
The Borel hierarchy gives a robust way to stratify the complexity of sets of countable structures and is intimately tied with definability in infinitary logic via the Lopez-Escobar theorem. However, what happens with sets axiomatizable in finitary first-order logic, such as the set of structures satisfying a given finitary first-order theory T? Is the complexity of the set of T's models in any way related to the quantifier complexity of the sentences axiomatizing it? In particular, if a theory T is not axiomatizable by a set of sentences of bounded quantifier complexity, can the set of models of T still be at a finite level of the Borel hierarchy?
In this talk, we will present results concerning these questions:
In joint work with Andrews, Gonzalez, Lempp, and Zhu we show that the set of models of a theory T is -complete if and only if T does not have an axiomatization by sentences of bounded quantifier complexity, answering the last question in the negative. We also characterize the Borel complexity of the set of models of complete theories in terms of their finitary axiomatizations. Our results suggest that infinitary logic does not provide any efficacy when defining first-order properties, a phenomenon already observed by Wadge and Keisler and, recently, rediscovered by Harrison-Trainor and Kretschmer using different techniques.
Combining our results with recent results by Enayat and Visser, we obtain that a large class of theories studied in the foundations of mathematics, sequential theories, have a maximal complicated set of models.
Spring 2024 (online)
- - - - Wednesday, Feb 14, 2024 - - - -
- - - - Thursday, Feb 15, 2024 - - - -
- - - - Friday, Feb 16, 2024 - - - -
Largeness notions
Finite Ramsey Theorem states that fixed , there exists such that for each coloring of with colors, there is a homogeneous subset of of cardinality at least . Starting with the celebrated Paris-Harrington theorem, many Ramsey-like results have been studied using different largeness notions rather than the cardinality. I will introduce the largeness notion defined by Ketonen and Solovay based on fundamental sequences of ordinals. Then I will describe an alternative and more flexible largeness notion using blocks and barriers. If time allows, I will talk about how the latter can be used to study a more general Ramsey-like result.
CUNY Graduate Center
The Ginsburg-Sands theorem and computability
In their 1979 paper `Minimal Infinite Topological Spaces,’ Ginsburg and Sands proved that every infinite topological space has an infinite subspace homeomorphic to exactly one of the following five topologies on : indiscrete, discrete, initial segment, final segment, and cofinite. The proof, while nonconstructive, features an interesting application of Ramsey's theorem for pairs (). We analyze this principle in computability theory and reverse mathematics, using Dorais's formalization of CSC spaces. Among our results are that the Ginsburg-Sands theorem for CSC spaces is equivalent to while for Hausdorff spaces it is provable in . Furthermore, if we enrich a CSC space by adding the closure operator on points, then the Ginsburg-Sands theorem turns out to be equivalent to the Chain-Antichain Principle (). The most surprising case is that of the Ginsburg-Sands theorem restricted to spaces. Here, we show that the principle lies strictly between and , yielding perhaps the first natural theorem of ordinary mathematics (i.e., conceived outside of logic) to occupy this interval. I will discuss the proofs of both the implications and separations, which feature several novel combinatorial elements, and survey a new class of purely combinatorial principles below and not implied by revealed by our investigation. This is joint work with Heidi Benham, Andrew DeLapo, Reed Solomon, and Java Darleen Villano.
- - - - Monday, Feb 19, 2024 - - - -
- - - - Tuesday, Feb 20, 2024 - - - -
- - - - Wednesday, Feb 21, 2024 - - - -
- - - - Thursday, Feb 22, 2024 - - - -
- - - - Friday, Feb 23, 2024 - - - -
CUNY Graduate Center
WHERE: Rutgers, The State University of New Jersey.
WHEN: Saturday, March 23
Find us on the web at: nylogic.github.io
(site designed, built & maintained by Victoria Gitman)
-------- ADMINISTRIVIA --------
To subscribe/unsubscribe to this list, please email your request to jreitz@citytech.cuny.edu.
If you have a logic-related event that you would like included in future mailings, please email jreitz@citytech.cuny.edu.
Wednesday seminar
Logic Seminar Talk 7 February 2024 17:00 hrs by Alexander Rabinovich at NUS
This Week in Logic at CUNY
Rutgers Logic Seminar
Monday, Feb 5, 3:30pm, Rutgers University, Hill 705
Filippo Calderoni, Rutgers
The L-space conjecture and descriptive set theory
Logic and Metaphysics Workshop
Date: Monday, Feb 5, 4.15-6.15pm (NY time)
Room: Graduate Center Room 7395
Title: Some model theory for axiomatic theories of truth
Abstract: Tarski’s arithmetic is the complete theory of (N,+,x,Tr), where (N,+,x) is the standard model of arithmetic and Tr is the set of Gödel numbers of all true arithmetic sentences. An axiomatic theory of truth is an axiomatic subtheory of Tarski’s arithmetic. If (M,+,x,T) is a model of an axiomatic theory of truth, then we call T a truth class. In 1981, Kotlarski, Krajewski, and Lachlan proved that every completion of Peano’s arithmetic has a model that is expandable to a model with a truth class T that satisfies all biconditionals in Tarski’s definition of truth formalized in PA. If T is such a truth class, it assigns truth values to all sentences in the sense of M, standard and nonstandard. The proof showed that such truth classes can be quite pathological. For example, they may declare true some infinite disjunctions of the single sentence (0=1). In 2018, Enayat and Visser gave a much simplified model-theoretic proof, which opened the door for further investigations of nonstandard truths, and many interesting new results by many authors appeared. I will survey some of them, concentrating on their model-theoretic content.
- - - - Tuesday, Feb 6, 2024 - - - -
- - - - Wednesday, Feb 7, 2024 - - - -
The New York City Category Theory Seminar
Department of Computer Science
Department of Mathematics
The Graduate Center of The City University of New York
URL: http://www.sci.brooklyn.cuny.edu/~noson/Seminar/index.html
Speaker: Saeed Salehi, Univeristy of Tarbiz.
Date and Time: Wednesday February 7, 2024, 11:00AM - 12:00 NOON. NOTICE SPECIAL TIME!!! ZOOM TALK!!! (see website for zoom link)
Title: On Chaitin's two HP's: (1) Heuristic Principle and (2) Halting Probability.
Abstract: Two important achievements of Chaitin will be investigated: the Omega number, which is claimed to be the halting probability of input-free programs, and the heuristic principle, which is claimed to hold for program-size complexity. Chaitin's heuristic principle says that the theories cannot prove the heavier sentences; the sentences and the theories were supposedly weighed by various computational complexities, which all turned out to be wrong or incomplete. In this talk, we will introduce a weighting that is not based on any computational complexity but on the provability power of the theories, for which Chaitin's heuristic principle holds true. Also, we will show that the Omega number is not equal to the halting probability of the input-free programs and will suggest some methods for calculating this probability, if any.
- - - - Thursday, Feb 8, 2024 - - - -
- - - - Friday, Feb 9, 2024 - - - -
Speaker: Emma Dinowitz, Grad Center
CUNY Graduate Center
Friday, Feb 9, 12:30pm NY time, Room: 6494
Tukey-top ultrafilters under UA
In the first part of the talk, we will provide some background and motivation to study the Glavin property. In particular, we will present a recently discovered connection between the Galvin property and the Tukey order on ultrafilters. This is a joint result with Natasha Dobrinen. In the second part, we will introduce several diamond-like principles for ultrafilters, and prove some relations with the Galvin property. Finally, we use the Ultrapower Axiom to characterize the Galvin property in the known canonical inner models. The second and third part is joint work with Gabriel Goldberg.
CUNY Graduate Center
Properties of Generic Algebraic Fields
The algebraic field extensions of the rational numbers – equivalently, the subfields of the algebraic closure – naturally form a topological space homeomorphic to Cantor space. Consequently, one can speak of 'large' collections of such fields, in the sense of Baire category: collections that are comeager in the space. Under a standard definition, the 1-generic fields form a comeager set in this space. Therefore, one may think of a property common to all 1-generic fields as a property that one might reasonably expect to be true of an arbitrarily chosen algebraic field.
We will present joint work with Eisenträger, Springer, and Westrick that proves several intriguing properties to be true of all 1-generic fields . First, in every such , both the subring of the integers and the subring of the algebraic integers of cannot be defined within by an existential formula, nor by a universal formula. (Subsequent work by Dittman and Fehm has shown that in fact these subrings are completely undefinable in these fields.) Next, for every presentation of every such , the root set
is always of low Turing degree relative to that presentation, but is essentially always undecidable relative to the presentation. Moreover, the set known as Hilbert's Tenth Problem for ,
is exactly as difficult as , which is its restriction to single-variable polynomials. Finally, even the question of having infinitely many solutions,
is only as difficult as . These results are proven by using a forcing notion on the fields and showing that it is decidable whether or not a given condition forces a given polynomial to have a root, or to have infinitely many roots.
- - - - Monday, Feb 12, 2024 - - - -
Rutgers Logic Seminar
Monday, Feb 12, 3:30pm, Rutgers University, Hill 705
- - - - Tuesday, Feb 13, 2024 - - - -
MOPA
The Borel hierarchy gives a robust way to stratify the complexity of sets of countable structures and is intimately tied with definability in infinitary logic via the Lopez-Escobar theorem. However, what happens with sets axiomatizable in finitary first-order logic, such as the set of structures satisfying a given finitary first-order theory T? Is the complexity of the set of T's models in any way related to the quantifier complexity of the sentences axiomatizing it? In particular, if a theory T is not axiomatizable by a set of sentences of bounded quantifier complexity, can the set of models of T still be at a finite level of the Borel hierarchy?
In this talk, we will present results concerning these questions:
In joint work with Andrews, Gonzalez, Lempp, and Zhu we show that the set of models of a theory T is -complete if and only if T does not have an axiomatization by sentences of bounded quantifier complexity, answering the last question in the negative. We also characterize the Borel complexity of the set of models of complete theories in terms of their finitary axiomatizations. Our results suggest that infinitary logic does not provide any efficacy when defining first-order properties, a phenomenon already observed by Wadge and Keisler and, recently, rediscovered by Harrison-Trainor and Kretschmer using different techniques.
Combining our results with recent results by Enayat and Visser, we obtain that a large class of theories studied in the foundations of mathematics, sequential theories, have a maximal complicated set of models.
- - - - Wednesday, Feb 14, 2024 - - - -
- - - - Thursday, Feb 15, 2024 - - - -
- - - - Friday, Feb 16, 2024 - - - -
Largeness notions
Finite Ramsey Theorem states that fixed , there exists such that for each coloring of with colors, there is a homogeneous subset of of cardinality at least . Starting with the celebrated Paris-Harrington theorem, many Ramsey-like results have been studied using different largeness notions rather than the cardinality. I will introduce the largeness notion defined by Ketonen and Solovay based on fundamental sequences of ordinals. Then I will describe an alternative and more flexible largeness notion using blocks and barriers. If time allows, I will talk about how the latter can be used to study a more general Ramsey-like result.
CUNY Graduate Center
Find us on the web at: nylogic.github.io
(site designed, built & maintained by Victoria Gitman)
-------- ADMINISTRIVIA --------
To subscribe/unsubscribe to this list, please email your request to jreitz@citytech.cuny.edu.
If you have a logic-related event that you would like included in future mailings, please email jreitz@citytech.cuny.edu.
Wednesday seminar
This Week in Logic at CUNY
Rutgers Logic Seminar
Monday, Jan 29, 3:30pm, Rutgers University, Hill 705
Jenna Zomback, Maryland
Boundary actions of free semigroups
- - - - Tuesday, Jan 30, 2024 - - - -
- - - - Wednesday, Jan 31, 2024 - - - -
- - - - Thursday, Feb 1, 2024 - - - -
- - - - Friday, Feb 2, 2024 - - - -
CUNY Graduate Center
Friday, Feb 2, 12:30pm NY time, Room: 6494
CUNY Graduate Center
- - - - Monday, Feb 5, 2024 - - - -
Logic and Metaphysics Workshop
Date: Monday, Feb 5, 4.15-6.15pm (NY time)
Room: Graduate Center Room 7395
Title: Some model theory for axiomatic theories of truth
Abstract: Tarski’s arithmetic is the complete theory of (N,+,x,Tr), where (N,+,x) is the standard model of arithmetic and Tr is the set of Gödel numbers of all true arithmetic sentences. An axiomatic theory of truth is an axiomatic subtheory of Tarski’s arithmetic. If (M,+,x,T) is a model of an axiomatic theory of truth, then we call T a truth class. In 1981, Kotlarski, Krajewski, and Lachlan proved that every completion of Peano’s arithmetic has a model that is expandable to a model with a truth class T that satisfies all biconditionals in Tarski’s definition of truth formalized in PA. If T is such a truth class, it assigns truth values to all sentences in the sense of M, standard and nonstandard. The proof showed that such truth classes can be quite pathological. For example, they may declare true some infinite disjunctions of the single sentence (0=1). In 2018, Enayat and Visser gave a much simplified model-theoretic proof, which opened the door for further investigations of nonstandard truths, and many interesting new results by many authors appeared. I will survey some of them, concentrating on their model-theoretic content.
- - - - Tuesday, Feb 6, 2024 - - - -
- - - - Wednesday, Feb 7, 2024 - - - -
The New York City Category Theory Seminar
Department of Computer Science
Department of Mathematics
The Graduate Center of The City University of New York
URL: http://www.sci.brooklyn.cuny.edu/~noson/Seminar/index.html
Speaker: Saeed Salehi, Univeristy of Tarbiz.
Date and Time: Wednesday February 7, 2024, 11:00AM - 12:00 NOON. NOTICE SPECIAL TIME!!! ZOOM TALK!!! (see website for zoom link)
Title: On Chaitin's two HP's: (1) Heuristic Principle and (2) Halting Probability.
Abstract: Two important achievements of Chaitin will be investigated: the Omega number, which is claimed to be the halting probability of input-free programs, and the heuristic principle, which is claimed to hold for program-size complexity. Chaitin's heuristic principle says that the theories cannot prove the heavier sentences; the sentences and the theories were supposedly weighed by various computational complexities, which all turned out to be wrong or incomplete. In this talk, we will introduce a weighting that is not based on any computational complexity but on the provability power of the theories, for which Chaitin's heuristic principle holds true. Also, we will show that the Omega number is not equal to the halting probability of the input-free programs and will suggest some methods for calculating this probability, if any.
- - - - Thursday, Feb 8, 2024 - - - -
- - - - Friday, Feb 9, 2024 - - - -
CUNY Graduate Center
Friday, Feb 9, 12:30pm NY time, Room: 6494
CUNY Graduate Center
Find us on the web at: nylogic.github.io
(site designed, built & maintained by Victoria Gitman)
-------- ADMINISTRIVIA --------
To subscribe/unsubscribe to this list, please email your request to jreitz@citytech.cuny.edu.
If you have a logic-related event that you would like included in future mailings, please email jreitz@citytech.cuny.edu.
43rd Nankai Logic Colloquium
Hello everyone,
This week our weekly Nankai Logic Colloquium is going to be in the morning.
Our speaker this week will be Alexander S. Kechris from the California Institute of Technology. This talk is going to take place this Friday, Jan 26, from 9am to 10am(UTC+8, Beijing time).
The records of past talks can be accessed at https://space.bilibili.com/253421893.
Best Wishes,
Ming Xiao
7th Workshop on Generalised Baire Spaces
Invitation to Logic Seminar 31 January 2024 17:00 hrs at NUS by Yu Liang
This Week in Logic at CUNY
- - - - Monday, Jan 22, 2024 - - - -
Rutgers Logic Seminar
Monday, Dec 11, 3:30pm, Rutgers University, Hill 705
Will Boney (Texas State)
- - - - Tuesday, Jan 23, 2024 - - - -
- - - - Wednesday, Jan 24, 2024 - - - -
- - - - Thursday, Jan 25, 2024 - - - -
- - - - Friday, Jan 26, 2024 - - - -
Memorial Lectures for Martin Davis
January 26, 2024
Courant Institute
All are welcome to attend this special event in memory of Professor Martin Davis.
There will be three lectures on his work from 1:00 - 2:30 pm, a memorial for Martin
and Virginia Davis from 2:45 - 3:45 pm, and a reception afterwards from 4-6 pm.
Preregistration is requested, ideally by January 15, using the website
https://cims.nyu.edu/dynamic/conferences/davis-memorial/
Next Week in Logic at CUNY:
- - - - Monday, Jan 29, 2024 - - - -
- - - - Tuesday, Jan 30, 2024 - - - -
- - - - Wednesday, Jan 31, 2024 - - - -
- - - - Thursday, Feb 1, 2024 - - - -
- - - - Friday, Feb 2, 2024 - - - -
Find us on the web at: nylogic.github.io
(site designed, built & maintained by Victoria Gitman)
-------- ADMINISTRIVIA --------
To subscribe/unsubscribe to this list, please email your request to jreitz@citytech.cuny.edu.
If you have a logic-related event that you would like included in future mailings, please email jreitz@citytech.cuny.edu.
Wednesday seminar
Second Wrocław Logic Conference, Wrocław, 31 May to 2 Jun, 2024
Set Theory and Topology Seminar 23.01.2024 Łukasz Mazurkiewicz
Łukasz Mazurkiewicz
Abstract.
(on behalf of the organizers, i.e. Piotr Borodulin-Nadzieja, Paweł Krupski, Aleksandra Kwiatkowska, Grzegorz Plebanek, Robert Rałowski and myself)
About 15 minutes before the seminar we invite you for coffee and a chat to social room.
https://settheory.pwr.edu.pl/
http://www.math.uni.wroc.pl/seminarium/topologia
Urgent Announcement of Nankai Logic Colloquium: change to Voov (Tencent meeting)
Hello everyone,
Sorry, we have changed the meeting software to Voov (Tencent meeting) because the our Zoom account has been banned.
Please download Voov (Tencent meeting) from the following link:
https://voovmeeting.com/download-center.html?from=1002
the attachment is the Manual for using Voov (Tencent meeting)
Best Wishes,
Ming Xiao
Set Theory in the United Kingdom, London, February 15, 2024
42nd Nankai Logic Colloquium
Hello everyone,
This week our weekly Nankai Logic Colloquium is going to be in the afternoon.
Our speaker this week will be Gianluca Paolini from the University of Turin. This talk is going to take place this Friday, Jan 19, from 4pm to 5pm(UTC+8, Beijing time).
The records of past talks can be accessed at https://space.bilibili.com/253421893.
Best Wishes,
Ming Xiao
Cross-Alps Logic Seminar for World Logic Day (speaker: Charles Steinhorn)
On
Friday 19.01.2023 at 16:00
on
the occasion of World Logic Day 2024, a special session of the
Cross-Alps Logic Seminars will take place, with special guest
Charles
Steinhorn (Vassar College)
who
will give a talk on
O-minimality
as a framework for tame mathematical economics
Please
refer to the usual webpage of our LogicGroup for more
details and the abstract of the talk.
The
seminar will be held remotely through Webex. Please write to
vincenzo.dimonte [at] uniud [dot] it for the link to the event.
The
Cross-Alps Logic Seminar is co-organized by the logic groups of
Genoa, Lausanne, Turin and Udine as part of our collaboration in the
project PRIN 2022 'Models, sets and classification'.
Wednesday seminar
Logic Seminar at NUS Wed 17.01.2024 17:00 hrs by Tatsuta Makoto
41st Nankai Logic Colloquium
Hello everyone,
This week our weekly Nankai Logic Colloquium is going to be in the afternoon.
Our speaker this week will be Felipe Garcia-Ramos from Jagiellonian University. This talk is going to take place this Friday, Jan 12, from 4pm to 5pm(UTC+8, Beijing time).
The records of past talks can be accessed at https://space.bilibili.com/253421893.
Best Wishes,
Ming Xiao
KGRC Talks - January 8-12
set theory and topology seminar 9.01.2024 Piotr Borodulin-Nadzieja
Piotr Borodulin-Nadzieja
Abstract.
(on behalf of the organizers, i.e. Piotr Borodulin-Nadzieja, Paweł Krupski, Aleksandra Kwiatkowska, Grzegorz Plebanek, Robert Rałowski and myself)
About 15 minutes before the seminar we invite you for coffee and a chat to social room.
https://settheory.pwr.edu.pl/
http://www.math.uni.wroc.pl/seminarium/topologia
Wednesday seminar
40th Nankai Logic Colloquium
Hello everyone,
This week our weekly Nankai Logic Colloquium is going to be in the afternoon.
Our speaker this week will be Steve Jackson from the University of North Texas. This talk is going to take place this Friday, Jan 05, from 4pm to 5pm(UTC+8, Beijing time).
The records of past talks can be accessed at https://space.bilibili.com/253421893.
Best Wishes,
Ming Xiao
Wednesday seminar
Stationary Sets and Algebra, VCU, May 20, 2024
39th Nankai Logic Colloquium
Hello everyone,
This week our weekly Nankai Logic Colloquium is going to be in the afternoon.
Our speaker this week will be Yinhe Peng from the Academy of Mathematics and Systems Science, CAS. This talk is going to take place this Friday, Dec 29, from 4pm to 5pm(UTC+8, Beijing time).
The records of past talks can be accessed at https://space.bilibili.com/253421893.
Best Wishes,
Ming Xiao
BLAST, North Texas, April 6-9, 2024
Wednesday seminar
Set Theory Seminar 19.12.2023 Aleksander Cieślak
Aleksander Cieślak
Abstract.
(on behalf of the organizers, i.e. Piotr Borodulin-Nadzieja, Paweł Krupski, Aleksandra Kwiatkowska, Grzegorz Plebanek, Robert Rałowski and myself)
About 15 minutes before the seminar we invite you for coffee and a chat to social room.
https://settheory.pwr.edu.pl/
http://www.math.uni.wroc.pl/seminarium/topologia
38th Nankai Logic Colloquium
Hello everyone,
This week our weekly Nankai Logic Colloquium is going to be in the morning.
Our speaker this week will be Forte Shinko from the University of California, Berkeley. This talk is going to take place this Friday, Dec 15, from 9am to 10am(UTC+8, Beijing time).
We are pausing our colloquium for once next week, due to the Annual Meeting of the Chinese Mathematical Society 2023. The Colloquium will be resumed Dec. 29.
Abstract: A countable discrete group is exact if it has a free action on Cantor space which is measure-hyperfinite, that is, for every Borel probability measure on Cantor space, there is a conull set on which the orbit equivalence relation is hyperfinite. For an exact group, it is known that the generic action on Cantor space is measure-hyperfinite, and it is open as to whether the generic action is hyperfinite; an exact group for which the generic action is not hyperfinite would resolve a long-standing open conjecture about whether measure-hyperfiniteness and hyperfiniteness are equivalent. We show that for any countable discrete group with finite asymptotic dimension, its generic action on Cantor space is hyperfinite. This is joint work with Sumun Iyer.
The records of past talks can be accessed from https://space.bilibili.com/253421893.
Best Wishes,
Ming Xiao
(KGRC) one talk TOMORROW, December 12, two talks on Thursday, December 14
This Week in Logic at CUNY
Rutgers Logic Seminar
Monday, Dec 11, 3:30pm, Rutgers University, Hill 705
Preserving the Ultrapower Axiom in forcing extensions
Logic and Metaphysics Workshop
Date: Monday, Dec 11, 4.15-6.15pm (NY time)
Room: Graduate Center Room 4419
Title: The logic of social choice
Abstract: Logic entered social choice theory through Kenneth Arrow who was a student of the logician Alfred Tarski at City College of New York. Arrow’s impossibility result, which was axiomatic in nature, showed that there is no rational procedure to define the popular choice when there are three or more candidates. Arrow’s result led to a rich field. However, subsequent work has concentrated on what happens when voters face a slate of three or more candidates. There is not enough work on a theory of candidate slates themselves. Thus an election with just Donald Trump and Joe Biden is seen as unproblematic since there are only two candidates. The actual quality of the candidates does not matter. We will propose a method which depends on the actual quality of a candidate. Then it becomes a dominant game theoretic strategy for each party to nominate as good a candidate as possible. The goodness of a candidate is defined in terms of a dot product of two vectors: the candidate’s position and the position of a typical voter.
- - - - Tuesday, Dec 12, 2023 - - - -
Models of Peano Arithmetic (MOPA)
Tuesday, Dec 12, 1:00pm
Virtual (email Victoria Gitman vgitman@gmail.com for meeting id)
Karel Hrbáček, CUNY
Multi-level nonstandard analysis, the axiom of choice, and recent work of R. Jin
Model-theoretic frameworks for nonstandard methods require the existence of nonprincipal ultrafilters over N, a strong form of the Axiom of Choice (AC). While AC is instrumental in many abstract areas of mathematics, its use in infinitesimal calculus or number theory should not be necessary.
In the paper KH and M. G. Katz, Infinitesimal analysis without the Axiom of Choice, Ann. Pure Applied Logic 172, 6 (2021), https://arxiv.org/abs/2009.04980, we have formulated SPOT, a theory in the language that has, in addition to membership, a unary predicate 'is standard.' The theory extends ZF by three simple axioms, Transfer, Nontriviality and Standard Part, that reflect the insights of Leibniz. It is a subtheory of the nonstandard set theories IST and HST, but unlike them, it is a conservative extension of ZF. Arguments carried out in SPOT thus do not depend on any form of AC. Infinitesimal calculus can be developed in SPOT. A stronger theory SCOT is a conservative extension of ZF + Dependent Choice. It is suitable for handling such features as an infinitesimal approach to the Lebesgue measure.
Renling Jin recently gave a groundbreaking nonstandard proof of Szemeredi's theorem in a model-theoretic framework that has three levels of infinity. I will formulate and motivate SPOTS, a multi-level version of SPOT, carry out Jin's proof of Ramsey's theorem in SPOTS, and discuss how his proof of Szemeredi's theorem can be developed in it.
While it is still open whether SPOTS is conservative over ZF, SCOTS (the multi-level version of SCOT) is a conservative extension of ZF + Dependent Choice.
- - - - Wednesday, Dec 13, 2023 - - - -
- - - - Thursday, Dec 14, 2023 - - - -
* EXAMS WEEK CUNY GRADUATE CENTER *
- - - - Friday, Dec 15, 2023 - - - -
- - - - Monday, Dec 18, 2023 - - - -
- - - - Tuesday, Dec 19, 2023 - - - -
- - - - Wednesday, Dec 20, 2023 - - - -
- - - - Thursday, Dec 21, 2023 - - - -
- - - - Friday, Dec 22, 2023 - - - -
Find us on the web at: nylogic.github.io
(site designed, built & maintained by Victoria Gitman)
-------- ADMINISTRIVIA --------
To subscribe/unsubscribe to this list, please email your request to jreitz@citytech.cuny.edu.
If you have a logic-related event that you would like included in future mailings, please email jreitz@citytech.cuny.edu.
Wednesday seminar
37th Nankai Logic Colloquium
Hello everyone,
This week our weekly Nankai Logic Colloquium is going to be in the morning.
Our speaker this week will be Wei He from Nanjing Normal University. This talk is going to take place this Friday, Dec 08, from 9am to 10am(UTC+8, Beijing time).
_____________________________________________________________________________________________________
The records of past talks can be accessed from https://space.bilibili.com/253421893.
Best Wishes,
Ming Xiao
(KGRC) CORRECTED: the future of KGRC announcements, plus three talks
UPDATE - This Week in Logic at CUNY
Monday, Dec 4, 3:30pm, Rutgers University, Hill 705
The computable model theory of forcing
Logic and Metaphysics Workshop
Date: Monday, Dec 4, 4.15-6.15pm (NY time)
Room: Graduate Center Room 4419
James Walsh (NYU)
Title: Use and mention in formal languages
Abstract: Quine’s distinction between use and mention is one of the cornerstones of analytic philosophy. The distinction is typically motivated with examples from natural language, but Quine also applied the distinction to the formal languages studied in mathematical logic. I will argue that such expressions are not used in Quine’s sense, so the distinction cannot appropriately be applied to them. Accordingly, the standard practice of placing quotation marks around expressions of formal languages is incorrect. This technical point serves as a springboard for discussing the role that formal languages play in mathematical logic.
- - - - Tuesday, Dec 5, 2023 - - - -
Models of Peano Arithmetic (MOPA)
Tuesday, Dec 5, 1:00pm
Virtual (email Victoria Gitman vgitman@gmail.com for meeting id)
Simplest model properties for Peano Arithmetic: On a question of Montalban and Rossegger
As famously shown by Scott, every countable structure can be characterized, up to isomorphism, by a sentence of infinitary language which allows for conjunctions and disjunctions over arbitrary countable families of formulae (over finitely many variables). Formulae of this language can be naturally assigned ranks based on the number of alternations of existential connectives (disjunctions and existential quantifiers) with universal ones (conjunctions and universal quantifiers). This gives rise to a natural complexity measure for countable models: the Scott rank of a model is the least such that can be uniquely characterized by a sentence of rank (and starting from the universal quantifier). The developments of computable model theory witness that the Scott rank is a very robust notion integrating other well established tools from descriptive set theory, model theory and computability.
In 'The Structural Complexity of Models of Arithmetic' Antonio Montalban and Dino Rossegger pioneered the Scott analysis of models of Peano Arithmetic. They characterized the Scott spectrum of completions PA , i.e. the set of ordinals which are Scott ranks of countable models of a given completion of PA. A particularly intriguing outcome of their analysis is that PA has exactly one model of the least rank, the standard model, and the Scott rank of every other model is infinite. Additionally they studied the connections between Scott ranks and model-theoretical properties of models, such as recursive saturation and atomicity, raising an open question: is there a non-atomic homogeneous model of PA of Scott rank ?
In the talk we answer the above question to the negative, showing that the nonstandard models of PA or rank are exactly the nonstandard prime models. This witness another peculiar property of PA: not only it has the simplest model, but also its every completion has a unique model of the least Scott rank. This is joint work with Patryk Szlufik.
- - - - Wednesday, Dec 6, 2023 - - - -
- - - - Thursday, Dec 7, 2023 - - - -
- - - - Friday, Dec 8, 2023 - - - -
Every archimedean real closed field is rigid, i.e., has no nontrivial automorphisms. What happens in the non-archimedean case? Shelah showed it is consistent that there are uncountable rigid non-archimedean real closed fields. Enayat asked what happens in the countable case. I believe the question is even interesting in the finite transcendence degree case. In this talk I will describe Shelah's proof and discuss some interesting phenomenon that arises even in transcendence degree 2.
CUNY Graduate Center
Michael Benedikt, Oxford University
Nested Data, Views, and Gaifman Coordinization
I will begin with an overview of how implicit definition, and variations of Beth's definability theorem, arise in relational databases, particularly in the context of view rewriting.
We then turn from relational databases to nested relational databases, a model of hierarchical data - 'objects' - where tables can contain tuples whose components are again tables. There is a standard transformation language for this data model, the Nested Relational Calculus (NRC). We show that a variant of Gaifman's coordinatization theorem plays a role in lieu of Beth's theorem, allowing one to generate NRC transformations from several kinds of implicit specifications. We discuss how to generate transformations effectively from specifications, which requires the development of proof-theoretic methods for implicit definability over nested sets.
This is joint work with Ceclia Pradic and Christoph Wernhard.
- - - - Monday, Dec 11, 2023 - - - -
Rutgers Logic Seminar
Monday, Dec 11, 3:30pm, Rutgers University, Hill 705
Preserving the Ultrapower Axiom in forcing extensions
Logic and Metaphysics Workshop
Date: Monday, Dec 11, 4.15-6.15pm (NY time)
Room: Graduate Center Room 4419
Title: The logic of social choice
Abstract: Logic entered social choice theory through Kenneth Arrow who was a student of the logician Alfred Tarski at City College of New York. Arrow’s impossibility result, which was axiomatic in nature, showed that there is no rational procedure to define the popular choice when there are three or more candidates. Arrow’s result led to a rich field. However, subsequent work has concentrated on what happens when voters face a slate of three or more candidates. There is not enough work on a theory of candidate slates themselves. Thus an election with just Donald Trump and Joe Biden is seen as unproblematic since there are only two candidates. The actual quality of the candidates does not matter. We will propose a method which depends on the actual quality of a candidate. Then it becomes a dominant game theoretic strategy for each party to nominate as good a candidate as possible. The goodness of a candidate is defined in terms of a dot product of two vectors: the candidate’s position and the position of a typical voter.
- - - - Tuesday, Dec 12, 2023 - - - -
Models of Peano Arithmetic (MOPA)
Tuesday, Dec 12, 1:00pm
Virtual (email Victoria Gitman vgitman@gmail.com for meeting id)
Karel Hrbáček, CUNY
Multi-level nonstandard analysis, the axiom of choice, and recent work of R. Jin
Model-theoretic frameworks for nonstandard methods require the existence of nonprincipal ultrafilters over N, a strong form of the Axiom of Choice (AC). While AC is instrumental in many abstract areas of mathematics, its use in infinitesimal calculus or number theory should not be necessary.
In the paper KH and M. G. Katz, Infinitesimal analysis without the Axiom of Choice, Ann. Pure Applied Logic 172, 6 (2021), https://arxiv.org/abs/2009.04980, we have formulated SPOT, a theory in the language that has, in addition to membership, a unary predicate 'is standard.' The theory extends ZF by three simple axioms, Transfer, Nontriviality and Standard Part, that reflect the insights of Leibniz. It is a subtheory of the nonstandard set theories IST and HST, but unlike them, it is a conservative extension of ZF. Arguments carried out in SPOT thus do not depend on any form of AC. Infinitesimal calculus can be developed in SPOT. A stronger theory SCOT is a conservative extension of ZF + Dependent Choice. It is suitable for handling such features as an infinitesimal approach to the Lebesgue measure.
Renling Jin recently gave a groundbreaking nonstandard proof of Szemeredi's theorem in a model-theoretic framework that has three levels of infinity. I will formulate and motivate SPOTS, a multi-level version of SPOT, carry out Jin's proof of Ramsey's theorem in SPOTS, and discuss how his proof of Szemeredi's theorem can be developed in it.
While it is still open whether SPOTS is conservative over ZF, SCOTS (the multi-level version of SCOT) is a conservative extension of ZF + Dependent Choice.
- - - - Wednesday, Dec 13, 2023 - - - -
- - - - Thursday, Dec 14, 2023 - - - -
* EXAMS WEEK CUNY GRADUATE CENTER *
- - - - Friday, Dec 15, 2023 - - - -
Find us on the web at: nylogic.github.io
(site designed, built & maintained by Victoria Gitman)
-------- ADMINISTRIVIA --------
To subscribe/unsubscribe to this list, please email your request to jreitz@citytech.cuny.edu.
If you have a logic-related event that you would like included in future mailings, please email jreitz@citytech.cuny.edu.
Wednesday seminar
Logic Seminar 5 Dec 2023 15:30 hrs at NUS by Lu Qi
This Week in Logic at CUNY
Monday, Dec 4, 3:30pm, Rutgers University, Hill 705
The computable model theory of forcing
Logic and Metaphysics Workshop
Date: Monday, Dec 4, 4.15-6.15pm (NY time)
Room: Graduate Center Room 4419
James Walsh (NYU)
Title: Use and mention in formal languages
Abstract: Quine’s distinction between use and mention is one of the cornerstones of analytic philosophy. The distinction is typically motivated with examples from natural language, but Quine also applied the distinction to the formal languages studied in mathematical logic. I will argue that such expressions are not used in Quine’s sense, so the distinction cannot appropriately be applied to them. Accordingly, the standard practice of placing quotation marks around expressions of formal languages is incorrect. This technical point serves as a springboard for discussing the role that formal languages play in mathematical logic.
- - - - Tuesday, Dec 5, 2023 - - - -
Models of Peano Arithmetic (MOPA)
Tuesday, Dec 5, 1:00pm
Virtual (email Victoria Gitman vgitman@gmail.com for meeting id)
Simplest model properties for Peano Arithmetic: On a question of Montalban and Rossegger
As famously shown by Scott, every countable structure can be characterized, up to isomorphism, by a sentence of infinitary language which allows for conjunctions and disjunctions over arbitrary countable families of formulae (over finitely many variables). Formulae of this language can be naturally assigned ranks based on the number of alternations of existential connectives (disjunctions and existential quantifiers) with universal ones (conjunctions and universal quantifiers). This gives rise to a natural complexity measure for countable models: the Scott rank of a model is the least such that can be uniquely characterized by a sentence of rank (and starting from the universal quantifier). The developments of computable model theory witness that the Scott rank is a very robust notion integrating other well established tools from descriptive set theory, model theory and computability.
In 'The Structural Complexity of Models of Arithmetic' Antonio Montalban and Dino Rossegger pioneered the Scott analysis of models of Peano Arithmetic. They characterized the Scott spectrum of completions PA , i.e. the set of ordinals which are Scott ranks of countable models of a given completion of PA. A particularly intriguing outcome of their analysis is that PA has exactly one model of the least rank, the standard model, and the Scott rank of every other model is infinite. Additionally they studied the connections between Scott ranks and model-theoretical properties of models, such as recursive saturation and atomicity, raising an open question: is there a non-atomic homogeneous model of PA of Scott rank ?
In the talk we answer the above question to the negative, showing that the nonstandard models of PA or rank are exactly the nonstandard prime models. This witness another peculiar property of PA: not only it has the simplest model, but also its every completion has a unique model of the least Scott rank. This is joint work with Patryk Szlufik.
- - - - Wednesday, Dec 6, 2023 - - - -
- - - - Thursday, Dec 7, 2023 - - - -
- - - - Friday, Dec 8, 2023 - - - -
Every archimedean real closed field is rigid, i.e., has no nontrivial automorphisms. What happens in the non-archimedean case? Shelah showed it is consistent that there are uncountable rigid non-archimedean real closed fields. Enayat asked what happens in the countable case. I believe the question is even interesting in the finite transcendence degree case. In this talk I will describe Shelah's proof and discuss some interesting phenomenon that arises even in transcendence degree 2.
CUNY Graduate Center
Michael Benedikt, Oxford University
Nested Data, Views, and Gaifman Coordinization
I will begin with an overview of how implicit definition, and variations of Beth's definability theorem, arise in relational databases, particularly in the context of view rewriting.
We then turn from relational databases to nested relational databases, a model of hierarchical data - 'objects' - where tables can contain tuples whose components are again tables. There is a standard transformation language for this data model, the Nested Relational Calculus (NRC). We show that a variant of Gaifman's coordinatization theorem plays a role in lieu of Beth's theorem, allowing one to generate NRC transformations from several kinds of implicit specifications. We discuss how to generate transformations effectively from specifications, which requires the development of proof-theoretic methods for implicit definability over nested sets.
This is joint work with Ceclia Pradic and Christoph Wernhard.
- - - - Monday, Dec 11, 2023 - - - -
Rutgers Logic Seminar
Monday, Dec 11, 3:30pm, Rutgers University, Hill 705
Preserving the Ultrapower Axiom in forcing extensions
- - - - Tuesday, Dec 12, 2023 - - - -
Models of Peano Arithmetic (MOPA)
Tuesday, Dec 12, 1:00pm
Virtual (email Victoria Gitman vgitman@gmail.com for meeting id)
Karel Hrbáček, CUNY
Multi-level nonstandard analysis, the axiom of choice, and recent work of R. Jin
Model-theoretic frameworks for nonstandard methods require the existence of nonprincipal ultrafilters over N, a strong form of the Axiom of Choice (AC). While AC is instrumental in many abstract areas of mathematics, its use in infinitesimal calculus or number theory should not be necessary.
In the paper KH and M. G. Katz, Infinitesimal analysis without the Axiom of Choice, Ann. Pure Applied Logic 172, 6 (2021), https://arxiv.org/abs/2009.04980, we have formulated SPOT, a theory in the language that has, in addition to membership, a unary predicate 'is standard.' The theory extends ZF by three simple axioms, Transfer, Nontriviality and Standard Part, that reflect the insights of Leibniz. It is a subtheory of the nonstandard set theories IST and HST, but unlike them, it is a conservative extension of ZF. Arguments carried out in SPOT thus do not depend on any form of AC. Infinitesimal calculus can be developed in SPOT. A stronger theory SCOT is a conservative extension of ZF + Dependent Choice. It is suitable for handling such features as an infinitesimal approach to the Lebesgue measure.
Renling Jin recently gave a groundbreaking nonstandard proof of Szemeredi's theorem in a model-theoretic framework that has three levels of infinity. I will formulate and motivate SPOTS, a multi-level version of SPOT, carry out Jin's proof of Ramsey's theorem in SPOTS, and discuss how his proof of Szemeredi's theorem can be developed in it.
While it is still open whether SPOTS is conservative over ZF, SCOTS (the multi-level version of SCOT) is a conservative extension of ZF + Dependent Choice.
- - - - Wednesday, Dec 13, 2023 - - - -
- - - - Thursday, Dec 14, 2023 - - - -
* EXAMS WEEK CUNY GRADUATE CENTER *
- - - - Friday, Dec 15, 2023 - - - -
Find us on the web at: nylogic.github.io
(site designed, built & maintained by Victoria Gitman)
-------- ADMINISTRIVIA --------
To subscribe/unsubscribe to this list, please email your request to jreitz@citytech.cuny.edu.
If you have a logic-related event that you would like included in future mailings, please email jreitz@citytech.cuny.edu.
Set Theory and Topology Seminar 5.12.2023 Daria Perkowska
Daria Perkowska
Abstract.
(on behalf of the organizers, i.e. Piotr Borodulin-Nadzieja, Paweł Krupski, Aleksandra Kwiatkowska, Grzegorz Plebanek, Robert Rałowski and myself)
About 15 minutes before the seminar we invite you for coffee and a chat to social room.
https://settheory.pwr.edu.pl/
http://www.math.uni.wroc.pl/seminarium/topologia
36th Nankai Logic Colloquium
Hello everyone,
This week our weekly Nankai Logic Colloquium is going to be in the afternoon.
Our speaker this week will be Victor Hugo Yanez from Nanjing Normal University. This talk is going to take place this Friday, Dec 01, from 4pm to 5pm(UTC+8, Beijing time).
_____________________________________________________________________________________________________
Title :The 36th Nankai Logic Colloquium --Victor Hugo Yañez
Time :16:00pm, Dec. 1, 2023(Beijing Time)
Zoom Number : 671 670 2069
Passcode : 773654
Link :https://us05web.zoom.us/j/6716702069?pwd=mhCy9U60VrE8F6YSCOxOlGxIDPFTgx.1&omn=89006488717
_____________________________________________________________________
Best wishes,
Ming Xiao
(KGRC) two seminar talks Thursday, November 30
Cross-Alps Logic Seminar (speaker: Zoltán Vidnyánszky)
This Week in Logic at CUNY
Logic and Metaphysics Workshop
Date: Monday, Nov 27, 4.15-6.15pm (NY time)
Room: Graduate Center Room 4419
Title: Truth with and without satisfaction
Abstract: The talk addresses a quite natural situation in mathematics. When one needs to define a concept and it is not possible to do a direct recursion on the concept itself, what one does is the next best thing which is to perform recursion on a related concept of which the original given concept can be shown to be a special case. Tarski, in his celebrated paper on “The Concept of Truth in Formalized Languages”, cannot give a definition of truth performing direct recursion on the concept of truth itself. Consequently, he settles on a definition in terms of satisfaction. Following Kit Fine and Timothy McCarthy, “Truth without Satisfaction”, I raise the issue of whether such an indirect procedure of giving a definition of truth is necessary or maybe an alternative definition of truth can be given without going through the related concept of satisfaction. My talk will investigate both certain technical and philosophical aspects of the two sets of formal constraints to defining truth with and without satisfaction.
- - - - Tuesday, Nov 28, 2023 - - - -
- - - - Wednesday, Nov 29, 2023 - - - -
The New York City Category Theory Seminar
Department of Computer Science
Department of Mathematics
The Graduate Center of The City University of New York
URL: http://www.sci.brooklyn.cuny.edu/~noson/Seminar/index.html
Date and Time: Wednesday November 29, 2023, 7:00 - 8:30 PM. ZOOM TALK.
- - - - Thursday, Nov 30, 2023 - - - -
- - - - Friday, Dec 1, 2023 - - - -
Rehana Patel Wesleyan University
CUNY Graduate Center
James Walsh, New York University
Is the consistency operator canonical?
It is a well-known empirical phenomenon that natural axiomatic theories are well-ordered by consistency strength. The restriction to natural theories is necessary; using ad-hoc techniques (such as self-reference and Rosser orderings) one can exhibit non-linearity and ill-foundedness in the consistency strength hierarchy. What explains the contrast between natural theories and axiomatic theories in general?
Our approach to this problem is inspired by work on an analogous problem in recursion theory. The natural Turing degrees are well-ordered by Turing reducibility, yet the Turing degrees in general are neither linearly ordered nor well-founded, as ad-hoc techniques (such as the priority method) bear out. Martin's Conjecture, which is still unresolved, is a proposed explanation for this phenomenon. In particular, Martin’s Conjecture specifies a way in which the Turing jump is canonical.
After discussing Martin’s Conjecture, we will formulate analogous proof-theoretic hypotheses according to which the consistency operator is canonical. We will then discuss results - both positive and negative - within this framework. Some of these results were obtained jointly with Antonio Montalbán.
- - - - Monday, Dec 4, 2023 - - - -
Monday, Dec 4, 3:30pm, Rutgers University, Hill 705
The computable model theory of forcing
Logic and Metaphysics Workshop
Date: Monday, Dec 4, 4.15-6.15pm (NY time)
Room: Graduate Center Room 4419
James Walsh (NYU)
Title: Use and mention in formal languages
Abstract: Quine’s distinction between use and mention is one of the cornerstones of analytic philosophy. The distinction is typically motivated with examples from natural language, but Quine also applied the distinction to the formal languages studied in mathematical logic. I will argue that such expressions are not used in Quine’s sense, so the distinction cannot appropriately be applied to them. Accordingly, the standard practice of placing quotation marks around expressions of formal languages is incorrect. This technical point serves as a springboard for discussing the role that formal languages play in mathematical logic.
- - - - Tuesday, Dec 5, 2023 - - - -
Models of Peano Arithmetic (MOPA)
Tuesday, Dec 5, 1:00pm
Virtual (email Victoria Gitman vgitman@gmail.com for meeting id)
Simplest model properties for Peano Arithmetic: On a question of Montalban and Rossegger
- - - - Wednesday, Dec 6, 2023 - - - -
- - - - Thursday, Dec 7, 2023 - - - -
- - - - Friday, Dec 8, 2023 - - - -
Every archimedean real closed field is rigid, i.e., has no nontrivial automorphisms. What happens in the non-archimedean case? Shelah showed it is consistent that there are uncountable rigid non-archimedean real closed fields. Enayat asked what happens in the countable case. I believe the question is even interesting in the finite transcendence degree case. In this talk I will describe Shelah's proof and discuss some interesting phenomenon that arises even in transcendence degree 2.
CUNY Graduate Center
Beth definability and nested relations
Find us on the web at: nylogic.github.io
(site designed, built & maintained by Victoria Gitman)
-------- ADMINISTRIVIA --------
To subscribe/unsubscribe to this list, please email your request to jreitz@citytech.cuny.edu.
If you have a logic-related event that you would like included in future mailings, please email jreitz@citytech.cuny.edu.
Set Theory and Topology Seminar 28.11.2023 Jarosław Swaczyna
Jarosław Swaczyna (Łódź University of Technology)
Abstract.
(on behalf of the organizers, i.e. Piotr Borodulin-Nadzieja, Paweł Krupski, Aleksandra Kwiatkowska, Grzegorz Plebanek, Robert Rałowski and myself)
About 15 minutes before the seminar we invite you for coffee and a chat to social room.
https://settheory.pwr.edu.pl/
http://www.math.uni.wroc.pl/seminarium/topologia
Wednesday seminar
(KGRC) videos, and the Set Theory Seminar talk this Thursday, November 23
UPDATE: This Week in Logic at CUNY
Rutgers Logic Seminar
Monday, Nov 20, 3:30pm, Rutgers University, Hill 705
Logic and Metaphysics Workshop
Date: Monday, Nov 20, 4.15-6.15pm (NY time)
Room: Graduate Center Room 4419
Marian Călborean (Bucharest).
Title: Vagueness and Frege
Abstract: A constant of Frege’s writing is his rejection of indeterminate predicates in natural language. I follow Frege’s remarks on vagueness from the early “Begriffsschrift” to his mature works, drawing parallels with contemporary theories of vagueness. I critically examine Frege’s arguments for the inconsistency of natural language and argue that the inability to accommodate vagueness and precision in his mature ontology and semantics is mainly due to heuristic rules which he took as essential, not to a deep problem in his fundamental apparatus.
- - - - Tuesday, Nov 21, 2023 - - - -
Tuesday, Nov 21, 12:00pm
Virtual (email Victoria Gitman vgitman@gmail.com for meeting id)
Saeideh Bahrami, Institute for Research in Fundamental Sciences
-small submodels of countable models of arithmetic
There has been a long tradition in the model theory of arithmetic of attributing the combinatorial properties of cardinal numbers in set theory to initial segments. Considering that the most basic use of cardinal numbers is to assign cardinality to sets, we can adapt a similar notion in models of arithmetic in the following way: for a given initial segment of any model of a fragment of arithmetic, say I, a subset of is called I-small if there exists a coded bijection in such that the range of the restriction of to is equal to . It turns out that for a given countable nonstandard model of I, when I is a strong cut, any -small -elementary submodel of contains , and inherits some good properties of . In this talk, we are going to review such properties through self-embeddings of .
- - - - Wednesday, Nov 22, 2023 - - - -
The New York City Category Theory Seminar
Department of Computer Science
Department of Mathematics
The Graduate Center of The City University of New York
URL: http://www.sci.brooklyn.cuny.edu/~noson/Seminar/index.html
Date and Time:
- - - - Thursday, Nov 23, 2023 - - - -
*** Graduate Center Closed (Thanksgiving) ***
- - - - Friday, Nov 24, 2023 - - - -
- - - - Monday, Nov 27, 2023 - - - -
Logic and Metaphysics Workshop
Date: Monday, Nov 20, 4.15-6.15pm (NY time)
Room: Graduate Center Room 4419
Title: Truth with and without satisfaction
Abstract: The talk addresses a quite natural situation in mathematics. When one needs to define a concept and it is not possible to do a direct recursion on the concept itself, what one does is the next best thing which is to perform recursion on a related concept of which the original given concept can be shown to be a special case. Tarski, in his celebrated paper on “The Concept of Truth in Formalized Languages”, cannot give a definition of truth performing direct recursion on the concept of truth itself. Consequently, he settles on a definition in terms of satisfaction. Following Kit Fine and Timothy McCarthy, “Truth without Satisfaction”, I raise the issue of whether such an indirect procedure of giving a definition of truth is necessary or maybe an alternative definition of truth can be given without going through the related concept of satisfaction. My talk will investigate both certain technical and philosophical aspects of the two sets of formal constraints to defining truth with and without satisfaction.
- - - - Tuesday, Nov 28, 2023 - - - -
- - - - Wednesday, Nov 29, 2023 - - - -
The New York City Category Theory Seminar
Department of Computer Science
Department of Mathematics
The Graduate Center of The City University of New York
URL: http://www.sci.brooklyn.cuny.edu/~noson/Seminar/index.html
Date and Time: Wednesday November 29, 2023, 7:00 - 8:30 PM. ZOOM TALK.
- - - - Thursday, Nov 30, 2023 - - - -
- - - - Friday, Dec 1, 2023 - - - -
Rehana Patel Wesleyan University
CUNY Graduate Center
Find us on the web at: nylogic.github.io
(site designed, built & maintained by Victoria Gitman)
-------- ADMINISTRIVIA --------
To subscribe/unsubscribe to this list, please email your request to jreitz@citytech.cuny.edu.
If you have a logic-related event that you would like included in future mailings, please email jreitz@citytech.cuny.edu.
35th Nankai Logic Colloquium
Hello everyone,
This week our weekly Nankai Logic Colloquium is going to be in the afternoon.
Our speaker this week will be Kazuyuki Tanaka from the Beijing Institute of Mathematical Sciences and Applications. This talk is going to take place this Friday, Nov 24, from 4pm to 5pm(UTC+8, Beijing time).
___________________________________________________________________________________________________________________________________________________
Title :The 35th Nankai Logic Colloquium --Kazuyuki Tanaka
Time :16:00pm, Nov. 24, 2023(Beijing Time)
Zoom Number :847 0296 7631
Passcode :547555
Link :https://zoom.us/j/84702967631?pwd=IApaBiX5Cqv58tVez39772LJdtHpfF.1
_____________________________________________________________________
Best wishes,
Ming Xiao
This Week in Logic at CUNY
Rutgers Logic Seminar
Monday, Nov 20, 3:30pm, Rutgers University, Hill 705
Logic and Metaphysics Workshop
Date: Monday, Nov 20, 4.15-6.15pm (NY time)
Room: Graduate Center Room 4419
Marian Călborean (Bucharest).
Title: Vagueness and Frege
Abstract: A constant of Frege’s writing is his rejection of indeterminate predicates in natural language. I follow Frege’s remarks on vagueness from the early “Begriffsschrift” to his mature works, drawing parallels with contemporary theories of vagueness. I critically examine Frege’s arguments for the inconsistency of natural language and argue that the inability to accommodate vagueness and precision in his mature ontology and semantics is mainly due to heuristic rules which he took as essential, not to a deep problem in his fundamental apparatus.
- - - - Tuesday, Nov 21, 2023 - - - -
Tuesday, Nov 21, 1:00pm
Virtual (email Victoria Gitman vgitman@gmail.com for meeting id)
Saeideh Bahrami, Institute for Research in Fundamental Sciences
-small submodels of countable models of arithmetic
There has been a long tradition in the model theory of arithmetic of attributing the combinatorial properties of cardinal numbers in set theory to initial segments. Considering that the most basic use of cardinal numbers is to assign cardinality to sets, we can adapt a similar notion in models of arithmetic in the following way: for a given initial segment of any model of a fragment of arithmetic, say I, a subset of is called I-small if there exists a coded bijection in such that the range of the restriction of to is equal to . It turns out that for a given countable nonstandard model of I, when I is a strong cut, any -small -elementary submodel of contains , and inherits some good properties of . In this talk, we are going to review such properties through self-embeddings of .
- - - - Wednesday, Nov 22, 2023 - - - -
The New York City Category Theory Seminar
Department of Computer Science
Department of Mathematics
The Graduate Center of The City University of New York
URL: http://www.sci.brooklyn.cuny.edu/~noson/Seminar/index.html
Date and Time: Wednesday November 22, 2023, 7:00 - 8:30 PM. ZOOM TALK.
- - - - Thursday, Nov 23, 2023 - - - -
*** Graduate Center Closed (Thanksgiving) ***
- - - - Friday, Nov 24, 2023 - - - -
- - - - Monday, Nov 27, 2023 - - - -
Logic and Metaphysics Workshop
Date: Monday, Nov 20, 4.15-6.15pm (NY time)
Room: Graduate Center Room 4419
Title: Truth with and without satisfaction
Abstract: The talk addresses a quite natural situation in mathematics. When one needs to define a concept and it is not possible to do a direct recursion on the concept itself, what one does is the next best thing which is to perform recursion on a related concept of which the original given concept can be shown to be a special case. Tarski, in his celebrated paper on “The Concept of Truth in Formalized Languages”, cannot give a definition of truth performing direct recursion on the concept of truth itself. Consequently, he settles on a definition in terms of satisfaction. Following Kit Fine and Timothy McCarthy, “Truth without Satisfaction”, I raise the issue of whether such an indirect procedure of giving a definition of truth is necessary or maybe an alternative definition of truth can be given without going through the related concept of satisfaction. My talk will investigate both certain technical and philosophical aspects of the two sets of formal constraints to defining truth with and without satisfaction.
- - - - Tuesday, Nov 28, 2023 - - - -
- - - - Wednesday, Nov 29, 2023 - - - -
The New York City Category Theory Seminar
Department of Computer Science
Department of Mathematics
The Graduate Center of The City University of New York
URL: http://www.sci.brooklyn.cuny.edu/~noson/Seminar/index.html
Date and Time: Wednesday November 29, 2023, 7:00 - 8:30 PM. ZOOM TALK.
- - - - Thursday, Nov 30, 2023 - - - -
- - - - Friday, Dec 1, 2023 - - - -
Rehana Patel Wesleyan University
CUNY Graduate Center
Find us on the web at: nylogic.github.io
(site designed, built & maintained by Victoria Gitman)
-------- ADMINISTRIVIA --------
To subscribe/unsubscribe to this list, please email your request to jreitz@citytech.cuny.edu.
If you have a logic-related event that you would like included in future mailings, please email jreitz@citytech.cuny.edu.
Set Theory and Topology Seminar 21.11.2023 Diego Mejia
Diego Mejia (Shizuoka University)
Abstract.
(on behalf of the organizers, i.e. Piotr Borodulin-Nadzieja, Paweł Krupski, Aleksandra Kwiatkowska, Grzegorz Plebanek, Robert Rałowski and myself)
About 15 minutes before the seminar we invite you for coffee and a chat to social room.
https://settheory.pwr.edu.pl/
http://www.math.uni.wroc.pl/seminarium/topologia
Wednesday seminar
(KGRC) two seminar talks Thursday, November 16
This Week in Logic at CUNY
Rutgers Logic Seminar
Monday, Nov 13, 3:30pm, Rutgers University, Hill 705
Finite Tukey Morphisms
Date: Monday, Nov 13, 4.15-6.15pm (NY time)
Room: Graduate Center Room 4419
Alex Skiles (Rutgers).
Title: Against zero-grounding
Abstract: A number of philosophers believe that there is an intelligible distinction between ungrounded truths, which are not grounded in any truths at all, and zero-grounded truths, which are grounded, yet there are no truths that they are grounded in. Rather being a mere academic curiosity, these philosophers have also argued that the notion of zero-grounding can be put to serious metaphysical work. In this paper, we present two arguments against the intelligibility of zero-grounding, and then reject several attempts to make zero-grounding intelligible that have been suggested by its proponents.
Note: This is joint work with Tien-Chun Lo and Gonzalo Rodriguez-Pereyra.
- - - - Tuesday, Nov 14, 2023 - - - -
Models of Peano Arithmetic (MOPA)
Tuesday, Nov 14, 1:00pm
Virtual (email Victoria Gitman vgitman@gmail.com for meeting id)
On the (non)elementarity of cofinal extension
Compared with end extensions, much little is known about cofinal extensions for models of fragments of PA, especially their elementarity. In this talk, I will try to give a complete characterization of the elementarity of cofinal extensions. I will present a systematic way to `compress' the truth of M into the second-order structure of a definable cut, and as a consequence, a correspondence theorem between the first-order theory of M and the second-order theory of the cut. Through this method I will construct several models with special cofinal extension properties. I will also show that every countable model of arithmetic fail to satisfy PA admits a non-elementary cofinal extension. It provides a model-theoretic characterization for PA in terms of cofinal extensions.
- - - - Wednesday, Nov 15, 2023 - - - -
- - - - Thursday, Nov 16, 2023 - - - -
- - - - Friday, Nov 17, 2023 - - - -
Scott Mutchnik, University of Illinois at Chicago
Theories
Among the classical properties of unstable theories defined by Shelah, our understanding of the strict order hierarchy, , has remained relatively limited past at the greatest. Methods originating from stability theory have given insight into the structure of stronger unstable classes, including simple and theories. In particular, syntactic information about formulas in a first-order theory often corresponds to semantic information about independence in a theory's models, which generalizes phenomena such as linear independence in vector spaces and algebraic independence in algebraically closed fields. We discuss how the fine structure of this independence reveals exponential behavior within the strict order hierarchy, particularly at the levels for positive integers . Our results suggest a potential theory of independence for theories, for arbitrarily large values of .
CUNY Graduate Center
Joel David Hamkins, Notre Dame University
The Wordle and Absurdle numbers
We consider the game of infinite Wordle as played on Baire space . The codebreaker can win in finitely many moves against any countable dictionary , but not against the full dictionary of Baire space. The Wordle number is the size of the smallest dictionary admitting such a winning strategy for the codebreaker, the corresponding Wordle ideal is the ideal generated by these dictionaries, which under MA includes all dictionaries of size less than the continuum. The Absurdle number, meanwhile, is the size of the smallest dictionary admitting a winning strategy for the absurdist in the two-player variant, infinite Absurdle. In ZFC there are nondetermined Absurdle games, with neither player having a winning strategy, but if one drops the axiom of choice, then the principle of Absurdle determinacy has large cardinal consistency strength over ZF+DC. This is joint work with Ben De Bondt (Paris).
- - - - Monday, Nov 20, 2023 - - - -
Rutgers Logic Seminar
Monday, Nov 20, 3:30pm, Rutgers University, Hill 705
Logic and Metaphysics Workshop
Date: Monday, Nov 20, 4.15-6.15pm (NY time)
Room: Graduate Center Room 4419
Marian Călborean (Bucharest).
Title: Vagueness and Frege
Abstract: A constant of Frege’s writing is his rejection of indeterminate predicates in natural language. I follow Frege’s remarks on vagueness from the early “Begriffsschrift” to his mature works, drawing parallels with contemporary theories of vagueness. I critically examine Frege’s arguments for the inconsistency of natural language and argue that the inability to accommodate vagueness and precision in his mature ontology and semantics is mainly due to heuristic rules which he took as essential, not to a deep problem in his fundamental apparatus.
- - - - Tuesday, Nov 21, 2023 - - - -
Tuesday, Nov 21, 1:00pm
Virtual (email Victoria Gitman vgitman@gmail.com for meeting id)
- - - - Wednesday, Nov 22, 2023 - - - -
The New York City Category Theory Seminar
Department of Computer Science
Department of Mathematics
The Graduate Center of The City University of New York
URL: http://www.sci.brooklyn.cuny.edu/~noson/Seminar/index.html
Date and Time: Wednesday November 22, 2023, 7:00 - 8:30 PM. ZOOM TALK.
- - - - Thursday, Nov 23, 2023 - - - -
*** Graduate Center Closed (Thanksgiving) ***
- - - - Friday, Nov 24, 2023 - - - -
https://cims.nyu.edu/dynamic/conferences/davis-memorial/
The event plans presentations by Allyn Jackson, Eugenio Omodeo and Wilfried Sieg and a session on Memories of Martin and Virginia Davis.
People who cannot attend in person may submit a paragraph or two to the organizers to be read aloud at the event.
Find us on the web at: nylogic.github.io
(site designed, built & maintained by Victoria Gitman)
-------- ADMINISTRIVIA --------
To subscribe/unsubscribe to this list, please email your request to jreitz@citytech.cuny.edu.
If you have a logic-related event that you would like included in future mailings, please email jreitz@citytech.cuny.edu.
Set Theory and Topology Seminar 14.11.2023 Aleksander Cieślak
| sob., 4 lis, 10:22 (8 dni temu) | |||
Aleksander Cieślak
Abstract.
(on behalf of the organizers, i.e. Piotr Borodulin-Nadzieja, Paweł Krupski, Aleksandra Kwiatkowska, Grzegorz Plebanek, Robert Rałowski and myself)
About 15 minutes before the seminar we invite you for coffee and a chat to social room.
https://settheory.pwr.edu.pl/
http://www.math.uni.wroc.pl/seminarium/topologia
Nankai Logic Colloquium
Hello everyone,
Welcome back to Nankai Logic Colloquium! This week our weekly Nankai Logic Colloquium is going to be in the morning.
Our speaker this week will be Marcin Sabok from McGill University. This talk is going to take place this Friday, Nov 17, from 9am to 10am(UTC+8, Beijing time).
___________________________________________________________________________________________________________________________________________________
Title :The 34th Nankai Logic Colloquium --Marcin Sabok
Time :9:00am, Nov. 17, 2023(Beijing Time)
Zoom Number :872 7448 5609
Passcode :448066
Link :https://zoom.us/j/87274485609?pwd=z90Pn2KFasUa3KbbvQ1d7xSl3eP6rc.1
_____________________________________________________________________
Best wishes,
Ming Xiao
(KGRC) two talks tomorrow, Thursday, November 9
This Week in Logic at CUNY
Date: Monday, Nov 6, 4.15-6.15pm (NY time)
Room: Graduate Center Room 4419
Alex Citkin (Metropolitan Telecommunications).
Title: On logics of acceptance and rejection
Abstract: In his book Formalization of Logic, Carnap suggested the following process of refutation: for any set of formulas Γ and any formula α, if Γ ⊢ α and α is rejected, reject Γ. Thus, in contrast to the Łukasiewicz’s approach to refutation, the predicate of rejection is defined on sets of formulas rather than just formulas. In addition to a predicate of rejection, we introduce a predicate of acceptance which is also defined on sets of formulas, and this leads us to constructing two-layered logical systems, the ground layer of which is a conventional deductive system (providing us with means for derivation), and the top layer having predicates of acceptance and rejection. In the case when the set of accepted formulas coincides with the set of theorems of the underlying logic and the set of rejected formulas coincides with the sets of non-theorems, we obtain a conventional deductive system. The predicate of acceptance can be non-adjunctive, and this allows us to use such systems as an alternative approach to defining Jaśkowski style discursive logics.
- - - - Tuesday, Nov 7, 2023 - - - -
Models of Peano Arithmetic (MOPA)
Tuesday, Nov 7, 1:00pm
Virtual (email Victoria Gitman vgitman@gmail.com for meeting id)
This talk is about the relationship between (weak) arithmetical theories and methods for automated inductive theorem proving. Automating the search for proofs by induction is an important topic in computer science with a history that stretches back decades. A variety of different approaches, algorithms and implementations has been developed.
In this talk I will present a logical approach for understanding the power and limits of methods for automated inductive theorem proving. A central tool are translations of proof systems that are intended for automated proof search into weak arithmetical theories. Another central tool are non-standard models of these weak arithmetical theories.
This approach allows to obtain independence results which are of practical interest in computer science. It also gives rise to a number of new problems and questions about weak arithmetical theories.
- - - - Wednesday, Nov 8, 2023 - - - -
Philog Seminar
November 8, 2023, Wednesday, 10 AM
Zoom meeting, please contact Rohit Parikh for zoom link
Conversational strategy and political discourse
The New York City Category Theory Seminar
Department of Computer Science
Department of Mathematics
The Graduate Center of The City University of New York
URL: http://www.sci.brooklyn.cuny.edu/~noson/Seminar/index.html
Speaker: Larry Moss, Indiana University, Bloomington .
Date and Time: Wednesday November 8, 2023, 7:00 - 8:30 PM. ZOOM TALK
Title: On Kripke, Vietoris, and Hausdorff Polynomial Functors.
Abstract: The Vietoris space of compact subsets of a given Hausdorff space yields an endofunctor V on the category of Hausdorff spaces. Vietoris polynomial endofunctors on that category are built from V, the identity and constant functors by forming products, coproducts and compositions. These functors are known to have terminal coalgebras and we deduce that they also have initial algebras. We present an analogous class of endofunctors on the category of extended metric spaces, using in lieu of V the Hausdorff functor H. We prove that the ensuing Hausdorff polynomial functors have terminal coalgebras and initial algebras. Whereas the canonical constructions of terminal coalgebras for Vietoris polynomial functors takes omega steps, one needs \omega + \omega steps in general for Hausdorff ones. We also give a new proof that the closed set functor on metric spaces has no fixed points.
- - - - Thursday, Nov 9, 2023 - - - -
- - - - Friday, Nov 10, 2023 - - - -
Asymptotics of the Spencer-Shelah Random Graph Sequence
In combinatorics, the Spencer-Shelah random graph sequence is a variation on the independent-edge random graph model. We fix an irrational number , and we probabilistically generate the n-th Spencer-Shelah graph (with parameter ) by taking vertices, and for every pair of distinct vertices, deciding whether they are connected with a biased coin flip, with success probability . On the other hand, in model theory, an -mac is a class of finite structures, where the cardinalities of definable subsets are particularly well-behaved. In this talk, we will introduce the notion of 'probabalistic -mac' and present an incomplete proof that the Spencer Shelah random graph sequence is an example of one.
CUNY Graduate Center
Victoria Gitman, CUNY
Upward Löwenheim Skolem numbers for abstract logics
Galeotti, Khomskii and Väänänen recently introduced the notion of the upward Löwenheim Skolem (ULS) number for an abstract logic. A cardinal is the upward Lowenheim Skolem number for a logic if it is the least cardinal with the property that whenever is a model of size at least satisfying a sentence in , then there are arbitrarily large models satisfying and having as a substructure (not necessarily elementary). If we remove the requirement that has to be a substructure of , we get the classic notion of a Hanf number. While proves that every logic has a Hanf number, having a ULS number often turns out to have large cardinal strength. In a joint work with Jonathan Osinski, we study the ULS numbers for several classical logics. We introduce a strengthening of the ULS number, the strong upward Löwenheim Skolem number SULS which strengthens the requirement that is a substructure to full elementarity in the logic . It is easy to see that both the ULS and the SULS number for a logic are bounded by the least strong compactness cardinal for , if it exists.
- - - - Monday, Nov 13, 2023 - - - -
Rutgers Logic Seminar
Monday, Nov 13, 3:30pm, Rutgers University, Hill 705
Finite Tukey Morphisms
Date: Monday, Nov 13, 4.15-6.15pm (NY time)
Room: Graduate Center Room 4419
Alex Skiles (Rutgers).
Title: Against zero-grounding
Abstract: A number of philosophers believe that there is an intelligible distinction between ungrounded truths, which are not grounded in any truths at all, and zero-grounded truths, which are grounded, yet there are no truths that they are grounded in. Rather being a mere academic curiosity, these philosophers have also argued that the notion of zero-grounding can be put to serious metaphysical work. In this paper, we present two arguments against the intelligibility of zero-grounding, and then reject several attempts to make zero-grounding intelligible that have been suggested by its proponents.
Note: This is joint work with Tien-Chun Lo and Gonzalo Rodriguez-Pereyra.
- - - - Tuesday, Nov 14, 2023 - - - -
Models of Peano Arithmetic (MOPA)
Tuesday, Nov 14, 1:00pm
Virtual (email Victoria Gitman vgitman@gmail.com for meeting id)
On the (non)elementarity of cofinal extension
Compared with end extensions, much little is known about cofinal extensions for models of fragments of PA, especially their elementarity. In this talk, I will try to give a complete characterization of the elementarity of cofinal extensions. I will present a systematic way to `compress' the truth of M into the second-order structure of a definable cut, and as a consequence, a correspondence theorem between the first-order theory of M and the second-order theory of the cut. Through this method I will construct several models with special cofinal extension properties. I will also show that every countable model of arithmetic fail to satisfy PA admits a non-elementary cofinal extension. It provides a model-theoretic characterization for PA in terms of cofinal extensions.
- - - - Wednesday, Nov 15, 2023 - - - -
- - - - Thursday, Nov 16, 2023 - - - -
- - - - Friday, Nov 17, 2023 - - - -
CUNY Graduate Center
Find us on the web at: nylogic.github.io
(site designed, built & maintained by Victoria Gitman)
-------- ADMINISTRIVIA --------
To subscribe/unsubscribe to this list, please email your request to jreitz@citytech.cuny.edu.
If you have a logic-related event that you would like included in future mailings, please email jreitz@citytech.cuny.edu.
Set Theory and Topology Seminar 7.11.2023 Zdenek Silber
Zdenek Silber (IM PAN)
Abstract.
(on behalf of the organizers, i.e. Piotr Borodulin-Nadzieja, Paweł Krupski, Aleksandra Kwiatkowska, Grzegorz Plebanek, Robert Rałowski and myself)
About 15 minutes before the seminar we invite you for coffee and a chat to social room.
https://settheory.pwr.edu.pl/
http://www.math.uni.wroc.pl/seminarium/topologia
Wednesday seminar
Set Theory and Topology Seminar 3.11.2023 Witold Marciszewski
Recall that a compact space K is Eberlein compact if it can be embedded into some Banach space X equipped with the weak topology; equivalently, for some set \Gamma, K can be embedded into the space c_0( \Gamma), endowed with the pointwise convergence topology.
A compact space K is \omega-Corson compact if, for some set \Gamma, K is homeomorphic to a subset of the \sigma-product of real lines \sigma(R^\Gamma), i.e. the subspace of the product R^\Gamma consisting of functions with finite supports. Clearly, every \omega-Corson compact space is Eberlein compact.
We will present a characterization of \omega-Corson compact spaces, and some other results concerning this class of spaces and related classes of Eberlein compacta.
This is a joint research with Grzegorz Plebanek and Krzysztof Zakrzewski, see
https://arxiv.org/abs/2107.02513
(on behalf of the organizers, i.e. Piotr Borodulin-Nadzieja, Paweł Krupski, Aleksandra Kwiatkowska, Grzegorz Plebanek, Robert Rałowski and myself)
About 15 minutes before the seminar we invite you for coffee and a chat to social room.
https://settheory.pwr.edu.pl/
http://www.math.uni.wroc.pl/seminarium/topologia
Wednesday seminar
Cross-Alps Logic Seminar (speaker: Steffen Lempp)
Steffen Lempp (University of Wisconsin)
will give a talk on
The complexity of the class of models of arithmetic
Please refer to the usual webpage of our LogicGroup for more details and the abstract of the talk.
The seminar will be held remotely through Webex. Please write to luca.mottoros [at] unito [dot] itfor the link to the event.
The Cross-Alps Logic Seminar is co-organized by the logic groups of Genoa, Lausanne, Turin and Udine as part of our collaboration in the project PRIN 2022 'Models, Sets and Classifications'.
Cross-Alps Logic Seminar (speaker: Steffen Lempp)
This Week in Logic at CUNY
- - - - Monday, Oct 30, 2023 - - - -
Rutgers Logic Seminar
Monday, Oct 30th, 3:30pm, Rutgers University, Hill 705
Condensation and solvable left-orderable groups
Logic and Metaphysics Workshop
Date: Monday, Oct 30, 4.15-6.15pm (NY time)
Room: Graduate Center Room 4419
Title: An approach to property-talk for property nominalists
Abstract: Properties, understood as immanent universals that are repeatable entities which distinct objects can each have at the same time and in different places, are weird, so weird, in fact, that if we could do without them, we probably should do so. An alternative to an approach that sanctions properties might suggest a deflationary view of property-talk according to which the raison d’être of our use of ‘property’ is that it serves a quasi-logical function that is akin to what alethic deflationists claim about truth-talk. Deflationists about property-talk normally subscribe to a form of property nominalism, which rejects the sort of property realism that takes properties to be immanent universals. In this talk, after highlighting some of the weirdness of, or worries for, property realism and explaining why certain forms of property nominalism should not be abided, I highlight the expressive role of property-talk and go on to explain how property-talk performs its roles by introducing what I call “adjectival predicate-variable deflationism” (“APVD”). As I will show, by incorporating APVD into a version of what I have called a “semantic-pretense involving fictionalism” (“SPIF”), we capture the full range of property-talk instances without compromising property nominalism. Time permitting, I will also highlight a virtue of my view, which another form of property nominalism cannot accommodate. If property nominalism is correct, then we should endorse the SPIF account of property-talk that I will develop in this talk.
Note: This is joint work with James A. Woodbridge.
- - - - Tuesday, Oct 31, 2023 - - - -
- - - - Wednesday, Nov 1, 2023 - - - -
- - - - Thursday, Nov 2, 2023 - - - -
- - - - Friday, Nov 3, 2023 - - - -
CUNY Graduate Center
Nonstandard methods without the Axiom of Choice
Mikhail Katz and I have formulated a set theory SPOT in the language that has, in addition to membership, a unary predicate “is standard.” In addition to ZF, the theory has three simple axioms, Transfer, Nontriviality and Standard Part, that reflect the insights of Leibniz. It is a subtheory of the nonstandard set theories IST and HST, but unlike them, it is a conservative extension of ZF. Arguments carried out in SPOT thus do not depend on any form of AC. Infinitesimal calculus can be developed in SPOT as far as the global version of Peano's Theorem (the usual proofs of which use ADC, the Axiom of Dependent Choice). The existence of upper Banach densities can be proved in SPOT.
The conservativity of SPOT over ZF is established by a construction that combines the methods of forcing developed by Ali Enayat for second-order arithmetic and Mitchell Spector for set theory with large cardinals.
A stronger theory SCOT is a conservative extension of ZF+ADC. It is suitable for handling such features as an infinitesimal approach to the Lebesgue measure.
I will also formulate an extension of SPOT to a theory with multiple levels of standardness SPOTS, in which Renling Jin's recent groundbreaking proof of Szemeredi's Theorem can be carried out. While it is an open question whether SPOTS is conservative over ZF, SPOTS + DC (Dependent Choice for relations definable in it) is a conservative extension of ZF + ADC.
Reference: KH and M. G. Katz, Infinitesimal analysis without the Axiom of Choice, Ann. Pure Applied Logic 172, 6 (2021). https://doi.org/10.1016/j.apal.2021.102959, https://arxiv.org/abs/2009.04980
- - - - Monday, Nov 6, 2023 - - - -
Date: Monday, Nov 6, 4.15-6.15pm (NY time)
Room: Graduate Center Room 4419
Alex Citkin (Metropolitan Telecommunications).
Title: On logics of acceptance and rejection
Abstract: In his book Formalization of Logic, Carnap suggested the following process of refutation: for any set of formulas Γ and any formula α, if Γ ⊢ α and α is rejected, reject Γ. Thus, in contrast to the Łukasiewicz’s approach to refutation, the predicate of rejection is defined on sets of formulas rather than just formulas. In addition to a predicate of rejection, we introduce a predicate of acceptance which is also defined on sets of formulas, and this leads us to constructing two-layered logical systems, the ground layer of which is a conventional deductive system (providing us with means for derivation), and the top layer having predicates of acceptance and rejection. In the case when the set of accepted formulas coincides with the set of theorems of the underlying logic and the set of rejected formulas coincides with the sets of non-theorems, we obtain a conventional deductive system. The predicate of acceptance can be non-adjunctive, and this allows us to use such systems as an alternative approach to defining Jaśkowski style discursive logics.
- - - - Tuesday, Nov 7, 2023 - - - -
Models of Peano Arithmetic (MOPA)
Tuesday, Nov 7, 1:00pm
Virtual (email Victoria Gitman vgitman@gmail.com for meeting id)
- - - - Wednesday, Nov 8, 2023 - - - -
The New York City Category Theory Seminar
Department of Computer Science
Department of Mathematics
The Graduate Center of The City University of New York
URL: http://www.sci.brooklyn.cuny.edu/~noson/Seminar/index.html
Speaker: Larry Moss, Indiana University, Bloomington .
Date and Time: Wednesday November 8, 2023, 7:00 - 8:30 PM. ZOOM TALK
Title: On Kripke, Vietoris, and Hausdorff Polynomial Functors.
Abstract: The Vietoris space of compact subsets of a given Hausdorff space yields an endofunctor V on the category of Hausdorff spaces. Vietoris polynomial endofunctors on that category are built from V, the identity and constant functors by forming products, coproducts and compositions. These functors are known to have terminal coalgebras and we deduce that they also have initial algebras. We present an analogous class of endofunctors on the category of extended metric spaces, using in lieu of V the Hausdorff functor H. We prove that the ensuing Hausdorff polynomial functors have terminal coalgebras and initial algebras. Whereas the canonical constructions of terminal coalgebras for Vietoris polynomial functors takes omega steps, one needs \omega + \omega steps in general for Hausdorff ones. We also give a new proof that the closed set functor on metric spaces has no fixed points.
- - - - Thursday, Nov 9, 2023 - - - -
- - - - Friday, Nov 10, 2023 - - - -
CUNY Graduate Center
Victoria Gitman, CUNY
Upward Löwenheim Skolem numbers for abstract logics
Galeotti, Khomskii and Väänänen recently introduced the notion of the upward Löwenheim Skolem (ULS) number for an abstract logic. A cardinal is the upward Lowenheim Skolem number for a logic if it is the least cardinal with the property that whenever is a model of size at least satisfying a sentence in , then there are arbitrarily large models satisfying and having as a substructure (not necessarily elementary). If we remove the requirement that has to be a substructure of , we get the classic notion of a Hanf number. While proves that every logic has a Hanf number, having a ULS number often turns out to have large cardinal strength. In a joint work with Jonathan Osinski, we study the ULS numbers for several classical logics. We introduce a strengthening of the ULS number, the strong upward Löwenheim Skolem number SULS which strengthens the requirement that is a substructure to full elementarity in the logic . It is easy to see that both the ULS and the SULS number for a logic are bounded by the least strong compactness cardinal for , if it exists.
Find us on the web at: nylogic.github.io
(site designed, built & maintained by Victoria Gitman)
-------- ADMINISTRIVIA --------
To subscribe/unsubscribe to this list, please email your request to jreitz@citytech.cuny.edu.
If you have a logic-related event that you would like included in future mailings, please email jreitz@citytech.cuny.edu.
Set Theory and Topology Seminar 31.10.2023 Aleksander Cieślak
Aleksander Cieślak
Abstract.
(on behalf of the organizers, i.e. Piotr Borodulin-Nadzieja, Paweł Krupski, Aleksandra Kwiatkowska, Grzegorz Plebanek, Robert Rałowski and myself)
About 15 minutes before the seminar we invite you for coffee and a chat to social room.
https://settheory.pwr.edu.pl/
http://www.math.uni.wroc.pl/seminarium/topologia
Wednesday seminar
This Week in Logic at CUNY
Rutgers Logic Seminar
Monday, Oct 23rd, 3:30pm, Rutgers University, Hill 705
Logic and Metaphysics Workshop
Date: Monday, Oct 23, 4.15-6.15pm (NY time)
Melissa Fusco (Columbia)
Title: Diachronic reasoning with conditionals
Abstract: I will discuss a hybrid decision theory, coinciding sometimes with (traditional) Evidential Decision Theory, but usually with (traditional) Causal Decision Theory, which is inspired by recent work on unified and fully compositional approaches to the probabilities of conditionals. The hybrid theory features a few other loci of interest: the partitionality of acts A ∈ {A} fails, and close attention is paid to how one might (dis)confirm chance hypotheses under the umbrella of the Principal Principle. On this theory, the probabilities of conditionals play a role in underwriting a theory of imaging that follows Skyrms’s Thesis (Skyrms, 1981, 1984). Moreover, the credences it is epistemically rational to assign to these conditionals guides updating on one’s own acts. This implies some departures from Conditionalization, which I defend on epistemological grounds.
- - - - Tuesday, Oct 24, 2023 - - - -
Models of Peano Arithmetic (MOPA)
Tuesday, Oct 24, 1:00pm
Virtual (email Victoria Gitman vgitman@gmail.com for meeting id)
Alessandro Berarducci and Marcello Mamino, University of Pisa
Provability logic: models within models in Peano Arithmetic
In 1994 Jech gave a model theoretic proof of Gödel's second incompleteness theorem for Zermelo-Fraenkel set theory in the following form: ZF does not prove that ZF has a model. Kotlarski showed that Jech's proof can be adapted to Peano Arithmetic with the role of models being taken by complete consistent extensions. In this note we take another step in the direction of replacing proof-theoretic by model-theoretic arguments. We show, without passing through the arithmetized completeness theorem, that the existence of a model of PA of complexity is independent of PA, where a model is identified with the set of formulas with parameters which hold in the model. Our approach is based on a new interpretation of the provability logic of Peano Arithmetic with the modal operator interpreted as truth in every -model.
- - - - Wednesday, Oct 25, 2023 - - - -
The New York City Category Theory Seminar
Department of Computer Science
Department of Mathematics
The Graduate Center of The City University of New York
URL: http://www.sci.brooklyn.cuny.edu/~noson/Seminar/index.html
Speaker: Emilio Minichiello, CUNY Graduate Center.
Date and Time: Wednesday October 25, 2023, 7:00 - 8:30 PM. IN PERSON TALK (GC 6417)
Title: A Mathematical Model of Package Management Systems.
Abstract: In this talk, I will review some recent joint work with Gershom Bazerman and Raymond Puzio. The motivation is simple: provide a mathematical model of package management systems, such as the Hackage package respository for Haskell, or Homebrew for Mac users. We introduce Dependency Structures with Choice (DSC) which are sets equipped with a collection of possible dependency sets for every element and satisfying some simple conditions motivated from real life use cases. We define a notion of morphism of DSCs, and prove that the resulting category of DSCs is equivalent to the category of antimatroids, which are mathematical structures found in combinatorics and computer science. We analyze this category, proving that it is finitely complete, has coproducts and an initial object, but does not have all coequalizers. Further, we construct a functor from a category of DSCs equipped with a certain subclass of morphisms to the opposite of the category of finite distributive lattices, making use of a simple finite characterization of the Bruns-Lakser completion.
- - - - Thursday, Oct 26, 2023 - - - -
- - - - Friday, Oct 27, 2023 - - - -
CUNY Graduate Center
Arnon Avron, Tel Aviv University
Poincaré-Weyl's predicativity: going beyond
On the basis of Poincaré and Weyl's view of predicativity as invariance, we develop an extensive framework for predicative, type-free first-order set theory in which and much bigger ordinals can be defined as von Neumann ordinals. This refutes the accepted view of as the 'limit of predicativity.' We also explain what is wrong in Feferman-Schütte analysis of predicativity on which this view of is based.
- - - - Monday, Oct 30, 2023 - - - -
Rutgers Logic Seminar
Monday, Oct 30th, 3:30pm, Rutgers University, Hill 705
Logic and Metaphysics Workshop
Date: Monday, Oct 30, 4.15-6.15pm (NY time)
Room: Graduate Center Room 4419
Title: An approach to property-talk for property nominalists
Abstract: Properties, understood as immanent universals that are repeatable entities which distinct objects can each have at the same time and in different places, are weird, so weird, in fact, that if we could do without them, we probably should do so. An alternative to an approach that sanctions properties might suggest a deflationary view of property-talk according to which the raison d’être of our use of ‘property’ is that it serves a quasi-logical function that is akin to what alethic deflationists claim about truth-talk. Deflationists about property-talk normally subscribe to a form of property nominalism, which rejects the sort of property realism that takes properties to be immanent universals. In this talk, after highlighting some of the weirdness of, or worries for, property realism and explaining why certain forms of property nominalism should not be abided, I highlight the expressive role of property-talk and go on to explain how property-talk performs its roles by introducing what I call “adjectival predicate-variable deflationism” (“APVD”). As I will show, by incorporating APVD into a version of what I have called a “semantic-pretense involving fictionalism” (“SPIF”), we capture the full range of property-talk instances without compromising property nominalism. Time permitting, I will also highlight a virtue of my view, which another form of property nominalism cannot accommodate. If property nominalism is correct, then we should endorse the SPIF account of property-talk that I will develop in this talk.
Note: This is joint work with James A. Woodbridge.
- - - - Tuesday, Oct 31, 2023 - - - -
- - - - Wednesday, Nov 1, 2023 - - - -
- - - - Thursday, Nov 2, 2023 - - - -
- - - - Friday, Nov 3, 2023 - - - -
CUNY Graduate Center
Nonstandard methods without the Axiom of Choice
Mikhail Katz and I have formulated a set theory SPOT in the language that has, in addition to membership, a unary predicate “is standard.” In addition to ZF, the theory has three simple axioms, Transfer, Nontriviality and Standard Part, that reflect the insights of Leibniz. It is a subtheory of the nonstandard set theories IST and HST, but unlike them, it is a conservative extension of ZF. Arguments carried out in SPOT thus do not depend on any form of AC. Infinitesimal calculus can be developed in SPOT as far as the global version of Peano's Theorem (the usual proofs of which use ADC, the Axiom of Dependent Choice). The existence of upper Banach densities can be proved in SPOT.
The conservativity of SPOT over ZF is established by a construction that combines the methods of forcing developed by Ali Enayat for second-order arithmetic and Mitchell Spector for set theory with large cardinals.
A stronger theory SCOT is a conservative extension of ZF+ADC. It is suitable for handling such features as an infinitesimal approach to the Lebesgue measure.
I will also formulate an extension of SPOT to a theory with multiple levels of standardness SPOTS, in which Renling Jin's recent groundbreaking proof of Szemeredi's Theorem can be carried out. While it is an open question whether SPOTS is conservative over ZF, SPOTS + DC (Dependent Choice for relations definable in it) is a conservative extension of ZF + ADC.
Reference: KH and M. G. Katz, Infinitesimal analysis without the Axiom of Choice, Ann. Pure Applied Logic 172, 6 (2021). https://doi.org/10.1016/j.apal.2021.102959, https://arxiv.org/abs/2009.04980
The 2023 Category Theory Octoberfest will be held on the weekend of October 28th through October 29th. The meeting will be virtual. Following the tradition of past Octoberfests, this is intended to be an informal meeting, covering all areas of category theory and its applications. Here is the official conference website:
https://richardblute.ca/octoberfest-2023/
At the moment, you'll find there the schedule with all speakers and titles, as well as the zoom link which will be the same for both days. The abstracts for all the talks will be available shortly.
- - - - Web Site - - - -
Find us on the web at: nylogic.github.io
(site designed, built & maintained by Victoria Gitman)
-------- ADMINISTRIVIA --------
To subscribe/unsubscribe to this list, please email your request to jreitz@citytech.cuny.edu.
If you have a logic-related event that you would like included in future mailings, please email jreitz@citytech.cuny.edu.
Logic Seminar Talks at NUS on 24 Oct, 31 Oct and 7 Nov 2023
(KGRC) talk in the Model Theory Seminar on Wednesday, October 25
Set Theory and Topology Seminar 24.10.2023 Maciej Korpalski
Maciej Korpalski
Abstract.
(on behalf of the organizers, i.e. Piotr Borodulin-Nadzieja, Paweł Krupski, Aleksandra Kwiatkowska, Grzegorz Plebanek, Robert Rałowski and myself)
About 15 minutes before the seminar we invite you for coffee and a chat to social room.
https://settheory.pwr.edu.pl/
http://www.math.uni.wroc.pl/seminarium/topologia
(KGRC) seminar talks Wednesday, October 18, and Thursday, October 19
This Week in Logic at CUNY
Monday, Oct 16th, 3:30pm, Rutgers University, Hill 705
Large minimal non-σ-scattered linear orders
Logic and Metaphysics Workshop
Date: Monday, Oct 16, 4.15-6.15pm (NY time)
Title: Maximal deontic logic
Abstract: The worlds accessible from a given world in Kripke models for deontic logic are often informally glossed as ideal or perfect worlds (at least, relative to the base world). Taking that language seriously, a straightforward but nonstandard semantic implementation using models containing maximally good worlds yields a deontic logic, MD, considerably stronger than that which most logicians would advocate for. In this talk, I examine this logic, its philosophical significance, and its technical properties, as well as those of the logics in its vicinity. The principal technical result is a proof that MD is pretabular (it has no finite characteristic matrix but all of its proper normal extensions do). Along the way, I also characterize all normal extensions of the quirky deontic logic D4H, prove that they are all decidable, and show that D4H has exactly two pretabular normal extensions.
- - - - Tuesday, Oct 17, 2023 - - - -
Models of Peano Arithmetic (MOPA)
Tuesday, Oct 17, 1:00pm
Virtual (email Victoria Gitman vgitman@gmail.com for meeting id)
Elliot Glazer, Harvard University
Coin flipping on models of arithmetic to define the standard cut
We will discuss the following claim: 'The standard cut of a model of PA (or even Q) is uniformly definable with respect to a randomly chosen predicate.' Restricting our consideration to countable models, this claim is true in the usual sense, i.e. there is a formula such that for any countable model of arithmetic the set is Lebesgue measure 1. However, if is countably saturated, then there is no such that is measured by the completed product measure on We will identify various combinatorial ideals on that can be used to formalize the original claim with no restriction on the cardinality of and discuss the relationship between closure properties of these ideals and principles of choice.
- - - - Wednesday, Oct 18, 2023 - - - -
The New York City Category Theory Seminar
Department of Computer Science
Department of Mathematics
The Graduate Center of The City University of New York
URL: http://www.sci.brooklyn.cuny.edu/~noson/Seminar/index.html
Speaker: Michael Shulman, University of San Diego.
Date and Time: Wednesday October 18, 2023, 7:00 - 8:30 PM. ZOOM TALK
Title: The derivator of setoids.
Abstract: The question of "what is a homotopy theory" or "what is a higher category" is already interesting in classical mathematics, but in constructive mathematics (such as the internal logic of a topos) it becomes even more subtle. In particular, existing constructive attempts to formulate a homotopy theory of spaces (infinity-groupoids) have the curious property that their "0-truncated objects" are more general than ordinary sets, being instead some kind of "free exact completion" of the category of sets (a.k.a. "setoids"). It is at present unclear whether this is a necessary feature of a constructive homotopy theory or whether it can be avoided somehow. One way to find some evidence about this question is to use the "derivators" of Heller, Franke, and Grothendieck, as they give us access to higher homotopical structure without depending on a preconcieved notion of what such a thing should be. It turns out that constructively, the free exact completion of the category of sets naturally forms a derivator that has a universal property analogous to the classical category of sets and to the classical homotopy theory of spaces: it is the "free cocompletion of a point" in a certain universe. This suggests that either setoids are an unavoidable aspect of constructive homotopy theory, or more radical modifications to the notion of homotopy theory are needed.
- - - - Thursday, Oct 19, 2023 - - - -
- - - - Friday, Oct 20, 2023 - - - -
CUNY Graduate Center
The number of ergodic models of an infinitary sentence
Given an -sentence in a countable language, we call an ergodic -invariant probability measure on the Borel space of countable models of (having fixed underlying set) an ergodic model of . I will discuss the number of ergodic models of such a sentence , including the case when is a Scott sentence. This is joint work with N. Ackerman, C. Freer, A. Kruckman and A. Kwiatkowska.
- - - - Monday, Oct 23, 2023 - - - -
Rutgers Logic Seminar
Monday, Oct 23rd, 3:30pm, Rutgers University, Hill 705
Logic and Metaphysics Workshop
Date: Monday, Oct 23, 4.15-6.15pm (NY time)
Melissa Fusco (Columbia)
Title: Diachronic reasoning with conditionals
Abstract: I will discuss a hybrid decision theory, coinciding sometimes with (traditional) Evidential Decision Theory, but usually with (traditional) Causal Decision Theory, which is inspired by recent work on unified and fully compositional approaches to the probabilities of conditionals. The hybrid theory features a few other loci of interest: the partitionality of acts A ∈ {A} fails, and close attention is paid to how one might (dis)confirm chance hypotheses under the umbrella of the Principal Principle. On this theory, the probabilities of conditionals play a role in underwriting a theory of imaging that follows Skyrms’s Thesis (Skyrms, 1981, 1984). Moreover, the credences it is epistemically rational to assign to these conditionals guides updating on one’s own acts. This implies some departures from Conditionalization, which I defend on epistemological grounds.
- - - - Tuesday, Oct 24, 2023 - - - -
Models of Peano Arithmetic (MOPA)
Tuesday, Oct 24, 1:00pm
Virtual (email Victoria Gitman vgitman@gmail.com for meeting id)
Alessandro Berarducci and Marcello Mamino, University of Pisa
Provability logic: models within models in Peano Arithmetic
In 1994 Jech gave a model theoretic proof of Gödel's second incompleteness theorem for Zermelo-Fraenkel set theory in the following form: ZF does not prove that ZF has a model. Kotlarski showed that Jech's proof can be adapted to Peano Arithmetic with the role of models being taken by complete consistent extensions. In this note we take another step in the direction of replacing proof-theoretic by model-theoretic arguments. We show, without passing through the arithmetized completeness theorem, that the existence of a model of PA of complexity is independent of PA, where a model is identified with the set of formulas with parameters which hold in the model. Our approach is based on a new interpretation of the provability logic of Peano Arithmetic with the modal operator interpreted as truth in every -model.
- - - - Wednesday, Oct 25, 2023 - - - -
The New York City Category Theory Seminar
Department of Computer Science
Department of Mathematics
The Graduate Center of The City University of New York
URL: http://www.sci.brooklyn.cuny.edu/~noson/Seminar/index.html
Speaker: Emilio Minichiello, CUNY Graduate Center.
Date and Time: Wednesday October 25, 2023, 7:00 - 8:30 PM. IN PERSON TALK (GC 6417)
Title: A Mathematical Model of Package Management Systems.
Abstract: In this talk, I will review some recent joint work with Gershom Bazerman and Raymond Puzio. The motivation is simple: provide a mathematical model of package management systems, such as the Hackage package respository for Haskell, or Homebrew for Mac users. We introduce Dependency Structures with Choice (DSC) which are sets equipped with a collection of possible dependency sets for every element and satisfying some simple conditions motivated from real life use cases. We define a notion of morphism of DSCs, and prove that the resulting category of DSCs is equivalent to the category of antimatroids, which are mathematical structures found in combinatorics and computer science. We analyze this category, proving that it is finitely complete, has coproducts and an initial object, but does not have all coequalizers. Further, we construct a functor from a category of DSCs equipped with a certain subclass of morphisms to the opposite of the category of finite distributive lattices, making use of a simple finite characterization of the Bruns-Lakser completion.
- - - - Thursday, Oct 26, 2023 - - - -
- - - - Friday, Oct 27, 2023 - - - -
CUNY Graduate Center
Arnon Avron, Tel Aviv University
Poincaré-Weyl's predicativity: going beyond
On the basis of Poincaré and Weyl's view of predicativity as invariance, we develop an extensive framework for predicative, type-free first-order set theory in which and much bigger ordinals can be defined as von Neumann ordinals. This refutes the accepted view of as the 'limit of predicativity.' We also explain what is wrong in Feferman-Schütte analysis of predicativity on which this view of is based.
Place: Wellesley College – All talks in Science Center N321
Gihanee Senadheera (Winthrop College)
Alex van Abel (Wesleyan University)
Neil Lutz (Swarthmore College)
Please find the webpage containing all relevant information below. Registration is optional but strongly encouraged for planning purpose.
https://sites.math.rutgers.edu/~fc327/GLaDF2023/index.html
- - - - Web Site - - - -
Find us on the web at: nylogic.github.io
(site designed, built & maintained by Victoria Gitman)
-------- ADMINISTRIVIA --------
To subscribe/unsubscribe to this list, please email your request to jreitz@citytech.cuny.edu.
If you have a logic-related event that you would like included in future mailings, please email jreitz@citytech.cuny.edu.
Set Theory and Topology Seminar 17.10.2023 Viktoriia Brydun
Viktoriia Brydun (Ivan Franko Lviv National University)
(on behalf of the organizers, i.e. Piotr Borodulin-Nadzieja, Paweł Krupski, Aleksandra Kwiatkowska, Grzegorz Plebanek, Robert Rałowski and myself)
About 15 minutes before the seminar we invite you for coffee and a chat to social room.
https://settheory.pwr.edu.pl/
http://www.math.uni.wroc.pl/seminarium/topologia
Logic Seminar 17 Oct 2023 17:00 hrs by Frank Stephan at NUS Mathematics
(KGRC) talks Wednesday (TODAY), Thursday, and Friday
This Week in Logic at CUNY
CUNY Graduate Center CLOSED TODAY
- - - - Tuesday, Oct 10, 2023 - - - -
- - - - Wednesday, Oct 11, 2023 - - - -
Department of Computer Science
Department of Mathematics
The Graduate Center of The City University of New York
URL: http://www.sci.brooklyn.cuny.edu/~noson/Seminar/index.html
Speaker: Thiago Alexandre, University of São Paulo (Brazil).
Date and Time: Wednesday October 11, 2023, 7:00 - 8:30 PM.
Title: Internal homotopy theories.
Abstract: The idea of 'Homotopy theories' was introduced by Heller in his seminal paper from 1988. Two years later, Grothendieck discovered the theory of derivators (1990), exposed in his late manuscript Les Dérivateurs, and developed further by several authors. Essentially, there are no significant differences between Heller's homotopy theories and Grothendieck's derivators. They are tautologically the same 2-categorical yoga. However, they come from distinct motivations. For Heller, derivators should be a definitive answer to the question "What is a homotopy theory?", while for Grothendieck, who was strongly inspired by topos cohomology, the first main motivation for derivators was to surpass some technical deficiencies that appeared in the theory of triangulated categories. Indeed, Grothendieck designed the axioms of derivators in light of a certain 2-functorial construction, which associates the corresponding (abelian) derived category to each topos, and more importantly, inverse and direct cohomological images to each geometric morphism. It was from this 2-functorial construction, from where topos cohomology arises, that Grothendieck discovered the axioms of derivators, which are surprisingly the same as Heller's homotopy theories. Nowadays, it is commonly accepted that a homotopy theory is a quasi-category, and they can all be presented by a localizer (M,W), i.e., a couple composed by a category M and a class of arrows in W. This point of view is not so far from Heller, since pre-derivators, quasi-categories, and localizers, are essentially equivalent as an answer to the question "What is a homotopy theory?". In my talk, I will expose these subjects in more detail, and I am also going to explore how to internalize a homotopy theory in an arbitrary (Grothendieck) topos, a problem which strongly relates formal logic and homotopical algebra.
- - - - Thursday, Oct 12, 2023 - - - -
- - - - Friday, Oct 13, 2023 - - - -
Vincent Guingona, Towson University
Indivisibility of Classes of Graphs
This talk will discuss my work with Miriam Parnes and four undergraduates which took place last summer at an REU at Towson University. We say that a class of structures in some fixed language is indivisible if, for all structures A in the class and number of colors k, there is a structure B in the class such that, no matter how we color B with k colors, there is a monochromatic copy of A in B. Parnes and I became interested in this property when studying the classification of theories via positive combinatorial configurations. In this talk, following the work with our students, I will examine indivisibility on classes of graphs. In particular, we will look at hereditarily sparse graphs, cographs, perfect graphs, threshold graphs, and a few other classes. This work is joint with Felix Nusbaum, Zain Padamsee, Miriam Parnes, Christian Pippin, and Ava Zinman.
CUNY Graduate Center
Philipp Rothmaler, CUNY
A theorem of Makkai implying the existence of strict Mittag-Leffler modules in a definable subcategory
In 1982 Makkai published a very general theorem about the existence of what he later called principally prime (we call them positive atomic) models of so-called regular theories [FULL CONTINUOUS EMBEDDINGS OF TOPOSES, TAMS 269], which seems to have gone largely unnoticed. (Regular he called those theories that are axiomatized by positive primitive (=pp) implications.) This is a strong existence result in some sort of positive logic in a very general categorical (including non-additive) setting. I first discuss its significance for definable subcategories of modules (=model categories of regular theories of modules), which play an important role in representation theory and module theory in general. Part of this is that there these models are precisely the strict Mittag-Leffler modules contained in and relativized to such definable subcategories. Makkai’s original proof is, in its generality, not easy to follow, and so it is of interest, especially to the algebraic community, to find an easier proof for modules. I present a recent one due to Prest. At the time being it works only for countable rings, in the uncountable case one still has to rely on Makkai’s original proof.
Place: Wellesley College – All talks in Science Center N321
- - - - Monday, Oct 16, 2023 - - - -
Monday, Oct 16th, 3:30pm, Rutgers University, Hill 705
Large minimal non-σ-scattered linear orders
Logic and Metaphysics Workshop
Date: Monday, Oct 16, 4.15-6.15pm (NY time)
Title: Maximal deontic logic
Abstract: The worlds accessible from a given world in Kripke models for deontic logic are often informally glossed as ideal or perfect worlds (at least, relative to the base world). Taking that language seriously, a straightforward but nonstandard semantic implementation using models containing maximally good worlds yields a deontic logic, MD, considerably stronger than that which most logicians would advocate for. In this talk, I examine this logic, its philosophical significance, and its technical properties, as well as those of the logics in its vicinity. The principal technical result is a proof that MD is pretabular (it has no finite characteristic matrix but all of its proper normal extensions do). Along the way, I also characterize all normal extensions of the quirky deontic logic D4H, prove that they are all decidable, and show that D4H has exactly two pretabular normal extensions.
- - - - Tuesday, Oct 17, 2023 - - - -
Models of Peano Arithmetic (MOPA)
Tuesday, Oct 17, 1:00pm
Virtual (email Victoria Gitman vgitman@gmail.com for meeting id)
Elliot Glazer, Harvard University
Coin flipping on models of arithmetic to define the standard cut
We will discuss the following claim: 'The standard cut of a model of PA (or even Q) is uniformly definable with respect to a randomly chosen predicate.' Restricting our consideration to countable models, this claim is true in the usual sense, i.e. there is a formula such that for any countable model of arithmetic the set is Lebesgue measure 1. However, if is countably saturated, then there is no such that is measured by the completed product measure on We will identify various combinatorial ideals on that can be used to formalize the original claim with no restriction on the cardinality of and discuss the relationship between closure properties of these ideals and principles of choice.
- - - - Wednesday, Oct 18, 2023 - - - -
The New York City Category Theory Seminar
Department of Computer Science
Department of Mathematics
The Graduate Center of The City University of New York
URL: http://www.sci.brooklyn.cuny.edu/~noson/Seminar/index.html
Speaker: Michael Shulman, University of San Diego.
Date and Time: Wednesday October 18, 2023, 7:00 - 8:30 PM.
Title: The derivator of setoids.
- - - - Thursday, Oct 19, 2023 - - - -
- - - - Friday, Oct 20, 2023 - - - -
CUNY Graduate Center
Place: Wellesley College – All talks in Science Center N321
Gihanee Senadheera (Winthrop College)
Alex van Abel (Wesleyan University)
Neil Lutz (Swarthmore College)
Please find the webpage containing all relevant information below. Registration is optional but strongly encouraged for planning purpose.
https://sites.math.rutgers.edu/~fc327/GLaDF2023/index.html
- - - - Web Site - - - -
Find us on the web at: nylogic.github.io
(site designed, built & maintained by Victoria Gitman)
-------- ADMINISTRIVIA --------
To subscribe/unsubscribe to this list, please email your request to jreitz@citytech.cuny.edu.
If you have a logic-related event that you would like included in future mailings, please email jreitz@citytech.cuny.edu.
Wednesday seminar
Set Theory and Topology Seminar 10.10.2023 Arturo Martinez
Arturo Martinez
(on behalf of the organizers, i.e. Piotr Borodulin-Nadzieja, Paweł Krupski, Aleksandra Kwiatkowska, Grzegorz Plebanek, Robert Rałowski and myself)
Abstract:
About 15 minutes before the seminar we invite you for coffee and a chat to social room.
https://settheory.pwr.edu.pl/
http://www.math.uni.wroc.pl/seminarium/topologia
This Week in Logic at CUNY
- - - - Monday, Oct 2, 2023 - - - -
Rutgers Logic Seminar
Monday, Oct 2nd, 3:30pm, Rutgers University, Hill 705
Characterizing LEF groups
Abstract: We propose a concrete characterization of locally-embeddable-into-finite (LEF) groups of cardinality larger than the continuum in terms of embeddings into the reduced product of finite symmetric groups. We show that whether this characterization holds is independent of ZFC. Analogous work has been done for the more general class of sofic groups. This is joint work with Simon Thomas.
Logic and Metaphysics Workshop
Date: Monday, Oct 2, 4.15-6.15pm (NY time)
Title: Whence admissibility constraints? From inferentialism to tolerance
Abstract: Prior’s invented connective ‘tonk’ is sometimes taken to reveal a problem for certain inferentialist approaches to metasemantics: according to such approaches, the truth-theoretic features of our expressions are fully determined by the rules of inference we’re disposed to follow, but admitting the ‘tonk’ rules into a language would lead to intuitively absurd results. Inferentialists tend to insist that they can avoid these results: there are constraints on what sets of inference rules can be admitted into a language, the story goes, and the rules governing disruptive expressions like ‘tonk’ are defective and so illegitimate. I argue, though, that from an inferentialist perspective, there’s no genuine sense in which rules like the ‘tonk’ rules are defective; those who endorse the relevant sort of inferentialism turn out to be committed to Carnap’s principle of tolerance. I then sketch an argument to the effect that this, despite appearances, isn’t a problem for inferentialism.
- - - - Tuesday, Oct 3, 2023 - - - -
- - - - Wednesday, Oct 4, 2023 - - - -
- - - - Thursday, Oct 5, 2023 - - - -
- - - - Friday, Oct 6, 2023 - - - -
CUNY Graduate Center
Jenna Zomback, University of Maryland
Ergodic theorems along trees
In the classical pointwise ergodic theorem for a probability measure preserving (pmp) transformation , one takes averages of a given integrable function over the intervals in front of the point . We prove a “backward” ergodic theorem for a countable-to-one pmp , where the averages are taken over subtrees of the graph of that are rooted at and lie behind (in the direction of ). Surprisingly, this theorem yields forward ergodic theorems for countable groups, in particular, one for pmp actions of free groups of finite rank, and can be extended to yield ergodic theorems for pmp actions of free semigroups as well. In each case, the averages are taken along subtrees of the standard Cayley graph rooted at the identity. This is joint work with Anush Tserunyan.
- - - - Monday, Oct 9, 2023 - - - -
- - - - Tuesday, Oct 10, 2023 - - - -
- - - - Wednesday, Oct 11, 2023 - - - -
Department of Computer Science
Department of Mathematics
The Graduate Center of The City University of New York
URL: http://www.sci.brooklyn.cuny.edu/~noson/Seminar/index.html
- - - - Thursday, Oct 12, 2023 - - - -
- - - - Friday, Oct 13, 2023 - - - -
Please find the webpage containing all relevant information below. Registration is optional but strongly encouraged for planning purpose.
https://sites.math.rutgers.edu/~fc327/GLaDF2023/index.html
- - - - Web Site - - - -
Find us on the web at: nylogic.github.io
(site designed, built & maintained by Victoria Gitman)
-------- ADMINISTRIVIA --------
To subscribe/unsubscribe to this list, please email your request to jreitz@citytech.cuny.edu.
If you have a logic-related event that you would like included in future mailings, please email jreitz@citytech.cuny.edu.
Wednesday seminar
Update - Logic Workshop cancelled today: This Week in Logic at CUNY
- - - - Monday, Sep 25, 2023 - - - -
NO CLASSES AT CUNY TODAY
Monday, Sept 25th, 3:30pm, Rutgers University, Hill 705
Mutual stationarity and the failure of SCH
- - - - Tuesday, Sep 26, 2023 - - - -
- - - - Wednesday, Sep 27, 2023 - - - -
This Week in Logic at CUNY:
- - - - Monday, Sep 25, 2023 - - - -
NO CLASSES AT CUNY TODAYRutgers Logic Seminar
Monday, Sept 25th, 3:30pm, Rutgers University, Hill 705Dima Sinapova, Rutgers
Mutual stationarity and the failure of SCH
- - - - Tuesday, Sep 26, 2023 - - - -
- - - - Wednesday, Sep 27, 2023 - - - -
The New York City Category Theory Seminar
Department of Computer Science
Department of Mathematics
The Graduate Center of The City University of New York
URL: http://www.sci.brooklyn.cuny.edu/~noson/Seminar/index.htmlSpeaker: Tomáš Gonda, University of Innsbruck.Date and Time: Wednesday September 27, 2023, 5:00 - 6:00 PM. ZOOM TALK. NOTE SPECIAL TIME!Title: A Framework for Universality in Physics, Computer Science, and Beyond.Abstract: Turing machines and spin models share a notion of universality according to which some simulate all others. We set up a categorical framework for universality which includes as instances universal Turing machines, universal spin models, NP completeness, top of a preorder, denseness of a subset, and others. By identifying necessary conditions for universality, we show that universal spin models cannot be finite. We also characterize when universality can be distinguished from a trivial one and use it to show that universal Turing machines are non-trivial in this sense. We leverage a Fixed Point Theorem inspired by a result of Lawvere to establish that universality and negation give rise to unreachability (such as uncomputability). As such, this work sets the basis for a unified approach to universality and invites the study of further examples within the framework.
- - - - Thursday, Sep 28, 2023 - - - -
- - - - Friday, Sep 29, 2023 - - - -Logic Workshop
CUNY Graduate CenterFriday Sept 29, 2:00pm-3:30pm, Room 6417Is the consistency operator canonical?
It is a well-known empirical phenomenon that natural axiomatic theories are well-ordered by consistency strength. The restriction to natural theories is necessary; using ad-hoc techniques (such as self-reference and Rosser orderings) one can exhibit non-linearity and ill-foundedness in the consistency strength hierarchy. What explains the contrast between natural theories and axiomatic theories in general?
Our approach to this problem is inspired by work on an analogous problem in recursion theory. The natural Turing degrees are well-ordered by Turing reducibility, yet the Turing degrees in general are neither linearly ordered nor well-founded, as ad-hoc techniques (such as the priority method) bear out. Martin's Conjecture, which is still unresolved, is a proposed explanation for this phenomenon. In particular, Martin’s Conjecture specifies a way in which the Turing jump is canonical.
After discussing Martin’s Conjecture, we will formulate analogous proof-theoretic hypotheses according to which the consistency operator is canonical. We will then discuss results - both positive and negative - within this framework. Some of these results were obtained jointly with Antonio Montalbán.
Next Week in Logic at CUNY:
- - - - Monday, Oct 2, 2023 - - - -
Rutgers Logic Seminar
Monday, Oct 2nd, 3:30pm, Rutgers University, Hill 705Philip Stetson, Rutgers
Characterizing LEF groups
Logic and Metaphysics Workshop
Date: Monday, Oct 2, 4.15-6.15pm (NY time)Room: Graduate Center Room 4419For meeting information, please sign up for our mailing list at https://logic.commons.gc.cuny.edu/about/Brett Topey (Salzburg)
Title: Whence admissibility constraints? From inferentialism to tolerance
Abstract: Prior’s invented connective ‘tonk’ is sometimes taken to reveal a problem for certain inferentialist approaches to metasemantics: according to such approaches, the truth-theoretic features of our expressions are fully determined by the rules of inference we’re disposed to follow, but admitting the ‘tonk’ rules into a language would lead to intuitively absurd results. Inferentialists tend to insist that they can avoid these results: there are constraints on what sets of inference rules can be admitted into a language, the story goes, and the rules governing disruptive expressions like ‘tonk’ are defective and so illegitimate. I argue, though, that from an inferentialist perspective, there’s no genuine sense in which rules like the ‘tonk’ rules are defective; those who endorse the relevant sort of inferentialism turn out to be committed to Carnap’s principle of tolerance. I then sketch an argument to the effect that this, despite appearances, isn’t a problem for inferentialism.
- - - - Tuesday, Oct 3, 2023 - - - -
- - - - Wednesday, Oct 4, 2023 - - - -
- - - - Thursday, Oct 5, 2023 - - - -
- - - - Friday, Oct 6, 2023 - - - -Logic Workshop
CUNY Graduate CenterFriday Sept 29, 2:00pm-3:30pm, Room 6417Jenna Zomback, University of Maryland
Ergodic theorems along treesIn the classical pointwise ergodic theorem for a probability measure preserving (pmp) transformation , one takes averages of a given integrable function over the intervals in front of the point . We prove a “backward” ergodic theorem for a countable-to-one pmp , where the averages are taken over subtrees of the graph of that are rooted at and lie behind (in the direction of ). Surprisingly, this theorem yields forward ergodic theorems for countable groups, in particular, one for pmp actions of free groups of finite rank, and can be extended to yield ergodic theorems for pmp actions of free semigroups as well. In each case, the averages are taken along subtrees of the standard Cayley graph rooted at the identity. This is joint work with Anush Tserunyan.
- - - - Other Logic News - - - -CONFERENCE ANNOUNCEMENTI am glad to announce the first installment of the meeting Groups Logic and Dynamics, on October 21. This will be a one day meeting held in New Brunswick. The format is modelled after the NERDS (https://nerds.math.uconn.edu/), for those of you who are familiar with it.
Please find the webpage containing all relevant information below. Registration is optional but strongly encouraged for planning purpose.
https://sites.math.rutgers.edu/~fc327/GLaDF2023/index.html- Filippo Calderonifc327 (at) math.rutgers.edu
- - - - Web Site - - - -
Find us on the web at: nylogic.github.io
(site designed, built & maintained by Victoria Gitman)
-------- ADMINISTRIVIA --------
To subscribe/unsubscribe to this list, please email your request to jreitz@citytech.cuny.edu.
If you have a logic-related event that you would like included in future mailings, please email jreitz@citytech.cuny.edu.
This Week in Logic at CUNY
- - - - Monday, Sep 25, 2023 - - - -
NO CLASSES AT CUNY TODAY
Monday, Sept 25th, 3:30pm, Rutgers University, Hill 705
Mutual stationarity and the failure of SCH
- - - - Tuesday, Sep 26, 2023 - - - -
- - - - Wednesday, Sep 27, 2023 - - - -
The New York City Category Theory Seminar
Department of Computer Science
Department of Mathematics
The Graduate Center of The City University of New York
URL: http://www.sci.brooklyn.cuny.edu/~noson/Seminar/index.html
- - - - Thursday, Sep 28, 2023 - - - -
- - - - Friday, Sep 29, 2023 - - - -
CUNY Graduate Center
Is the consistency operator canonical?
It is a well-known empirical phenomenon that natural axiomatic theories are well-ordered by consistency strength. The restriction to natural theories is necessary; using ad-hoc techniques (such as self-reference and Rosser orderings) one can exhibit non-linearity and ill-foundedness in the consistency strength hierarchy. What explains the contrast between natural theories and axiomatic theories in general?
Our approach to this problem is inspired by work on an analogous problem in recursion theory. The natural Turing degrees are well-ordered by Turing reducibility, yet the Turing degrees in general are neither linearly ordered nor well-founded, as ad-hoc techniques (such as the priority method) bear out. Martin's Conjecture, which is still unresolved, is a proposed explanation for this phenomenon. In particular, Martin’s Conjecture specifies a way in which the Turing jump is canonical.
After discussing Martin’s Conjecture, we will formulate analogous proof-theoretic hypotheses according to which the consistency operator is canonical. We will then discuss results - both positive and negative - within this framework. Some of these results were obtained jointly with Antonio Montalbán.
- - - - Monday, Oct 2, 2023 - - - -
Rutgers Logic Seminar
Monday, Oct 2nd, 3:30pm, Rutgers University, Hill 705
Characterizing LEF groups
Logic and Metaphysics Workshop
Date: Monday, Oct 2, 4.15-6.15pm (NY time)
Title: Whence admissibility constraints? From inferentialism to tolerance
Abstract: Prior’s invented connective ‘tonk’ is sometimes taken to reveal a problem for certain inferentialist approaches to metasemantics: according to such approaches, the truth-theoretic features of our expressions are fully determined by the rules of inference we’re disposed to follow, but admitting the ‘tonk’ rules into a language would lead to intuitively absurd results. Inferentialists tend to insist that they can avoid these results: there are constraints on what sets of inference rules can be admitted into a language, the story goes, and the rules governing disruptive expressions like ‘tonk’ are defective and so illegitimate. I argue, though, that from an inferentialist perspective, there’s no genuine sense in which rules like the ‘tonk’ rules are defective; those who endorse the relevant sort of inferentialism turn out to be committed to Carnap’s principle of tolerance. I then sketch an argument to the effect that this, despite appearances, isn’t a problem for inferentialism.
- - - - Tuesday, Oct 3, 2023 - - - -
- - - - Wednesday, Oct 4, 2023 - - - -
- - - - Thursday, Oct 5, 2023 - - - -
- - - - Friday, Oct 6, 2023 - - - -
CUNY Graduate Center
Jenna Zomback, University of Maryland
Ergodic theorems along trees
In the classical pointwise ergodic theorem for a probability measure preserving (pmp) transformation , one takes averages of a given integrable function over the intervals in front of the point . We prove a “backward” ergodic theorem for a countable-to-one pmp , where the averages are taken over subtrees of the graph of that are rooted at and lie behind (in the direction of ). Surprisingly, this theorem yields forward ergodic theorems for countable groups, in particular, one for pmp actions of free groups of finite rank, and can be extended to yield ergodic theorems for pmp actions of free semigroups as well. In each case, the averages are taken along subtrees of the standard Cayley graph rooted at the identity. This is joint work with Anush Tserunyan.
Please find the webpage containing all relevant information below. Registration is optional but strongly encouraged for planning purpose.
https://sites.math.rutgers.edu/~fc327/GLaDF2023/index.html
- - - - Web Site - - - -
Find us on the web at: nylogic.github.io
(site designed, built & maintained by Victoria Gitman)
-------- ADMINISTRIVIA --------
To subscribe/unsubscribe to this list, please email your request to jreitz@citytech.cuny.edu.
If you have a logic-related event that you would like included in future mailings, please email jreitz@citytech.cuny.edu.
Wednesday seminar
Wednesday seminar
This Week in Logic at CUNY
- - - - Monday, Sep 18, 2023 - - - -
Rutgers Logic Seminar
Monday, Sept 18th, 3:30pm, Rutgers University, Hill 705
Alex Kruckman (Wesleyan)
The complexity of ages admitting a universal limit structure.
Abstract: An age is a hereditary class of finitely generated structures with the joint embedding property which is countable up to isomorphism. If K is an age, a K-limit is a countable structure M such that every finitely generated substructure of M is in K. A K-limit U is universal if every K-limit embeds in U. It is well-known that K has the amalgamation property (AP) if and only if K admits a homogeneous limit (the Fraïssé limit), which is universal. But not every age with a universal limit has AP. We show that, while the existence of a universal limit can be characterized by the well-definedness of a certain ordinal-valued rank on structures in K, it is not equivalent to any finitary diagrammatic property like AP. More precisely, we show that for ages in a fixed sufficiently rich language L, the property of admitting a universal limit is complete coanalytic. This is joint work with Aristotelis Panagiotopoulos.
Date: Monday, Sept 18, 4.15-6.15pm (NY time)
Title: Non-classicality all the way up
Abstract: Nearly all non-classical logics that have been studied admit of classical reasoning about them. For example, in the logic K3, A or not-A is not a valid schema. However, ‘A or not-A’ is K3-valid or not K3-valid—this is, in some sense, a valid claim. In this talk, I introduce a simple framework for thinking about the logic of a given logic. This allows for a measure of the non-classicality of a logic—one on which almost all familiar non-classical logics are of the lowest grade of non-classicality. I’ll then discuss some strategies for generating and theorizing logics of higher grades of non-classicality, as well as some motivation for taking these logics seriously.
- - - - Tuesday, Sep 19, 2023 - - - -
- - - - Wednesday, Sep 20, 2023 - - - -
- - - - Thursday, Sep 21, 2023 - - - -
Infinite Games Workshop
Zoom Talk, details at https://jdh.hamkins.org/infinite-games-workshop/
Thursday 21 September, 11 am
Speaker: Davide Leonessi, The Graduate Center of the City University of New York
Title: Infinite draughts: a solved open game
- - - - Friday, Sep 22, 2023 - - - -
CUNY Graduate Center, Room 5383
Friday, Sept 22, 12:30-2:00pm
CUNY Graduate Center
David Marker, University of Illinois at Chicago
On equations of Poizat type
We look at differential equations of the form where is a rational function over the field of constants. We characterize when such equations are strongly minimal and study algebraic relations between solutions to two such equations.
- - - - Monday, Sep 25, 2023 - - - -
- - - - Tuesday, Sep 26, 2023 - - - -
- - - - Wednesday, Sep 27, 2023 - - - -
The New York City Category Theory Seminar
Department of Computer Science
Department of Mathematics
The Graduate Center of The City University of New York
URL: http://www.sci.brooklyn.cuny.edu/~noson/Seminar/index.html
- - - - Thursday, Sep 28, 2023 - - - -
- - - - Friday, Sep 29, 2023 - - - -
CUNY Graduate Center
Please find the webpage containing all relevant information below. Registration is optional but strongly encouraged for planning purpose.
https://sites.math.rutgers.edu/~fc327/GLaDF2023/index.html
- - - - Web Site - - - -
Find us on the web at: nylogic.github.io
(site designed, built & maintained by Victoria Gitman)
-------- ADMINISTRIVIA --------
To subscribe/unsubscribe to this list, please email your request to jreitz@citytech.cuny.edu.
If you have a logic-related event that you would like included in future mailings, please email jreitz@citytech.cuny.edu.
Logic Seminar 19 Sept 2023 17:00 hrs at NUS by Neoh Tzeh Yuan
This Week in Logic at CUNY
- - - - Monday, Sep 11, 2023 - - - -
Rutgers Logic Seminar
Monday, Sept 11th, 3:30pm, Rutgers University, Hill 705
The Tukey order on ultrafilters, the Galvin property, and the Ultrapower Axiom
Logic and Metaphysics Workshop
Date: Monday, Sept 11, 4.15-6.15pm (NY time)
Francesco Paoli, Cagliari
Title: Logical metainferentialism
Abstract: Logical inferentialism is the view that the meaning of the logical constants is determined by the rules of inference that govern their behaviour in proofs – in particular, sequent calculus proofs, according to the preferences of several recent authors. When it comes to the nuts and bolts, however, the view is tenable only if certain aspects – concerning e.g. harmony criteria for rules, normal forms, or proof-theoretic validity – are clarified. Sequent calculus inferentialists generally do so in terms of proofs from axioms, not of derivations from assumptions. Although the merits of this approach are already debatable in traditional settings, recent work on sequent calculi without Identity or Cut has revealed further shortcomings. Logical metainferentialism revises inferentialism in this more general perspective. In this talk, we will sketch the basics of this view and argue that, from this vantage point, the claim that LP is the “One True Logic” may appeal even to the inferentialistically inclined logician.
- - - - Tuesday, Sep 12, 2023 - - - -
- - - - Wednesday, Sep 13, 2023 - - - -
- - - - Thursday, Sep 14, 2023 - - - -
- - - - Monday, Sep 18, 2023 - - - -
Logic and Metaphysics Workshop
Date: Monday, Sept 18, 4.15-6.15pm (NY time)
Title: Non-classicality all the way up
Abstract: Nearly all non-classical logics that have been studied admit of classical reasoning about them. For example, in the logic K3, A or not-A is not a valid schema. However, ‘A or not-A’ is K3-valid or not K3-valid—this is, in some sense, a valid claim. In this talk, I introduce a simple framework for thinking about the logic of a given logic. This allows for a measure of the non-classicality of a logic—one on which almost all familiar non-classical logics are of the lowest grade of non-classicality. I’ll then discuss some strategies for generating and theorizing logics of higher grades of non-classicality, as well as some motivation for taking these logics seriously.
- - - - Tuesday, Sep 19, 2023 - - - -
- - - - Wednesday, Sep 20, 2023 - - - -
- - - - Thursday, Sep 21, 2023 - - - -
- - - - Friday, Sep 22, 2023 - - - -
CUNY Graduate Center, Room 5383
Friday, Sept 22, 12:30-2:00pm
CUNY Graduate Center
David Marker, University of Illinois at Chicago
On equations of Poizat type
We look at differential equations of the form where is a rational function over the field of constants. We characterize when such equations are strongly minimal and study algebraic relations between solutions to two such equations.
- - - - Web Site - - - -
Find us on the web at: nylogic.github.io
(site designed, built & maintained by Victoria Gitman)
-------- ADMINISTRIVIA --------
To subscribe/unsubscribe to this list, please email your request to jreitz@citytech.cuny.edu.
If you have a logic-related event that you would like included in future mailings, please email jreitz@citytech.cuny.edu.
Wednesday seminar
Logic Seminars next week
Logic Seminar Today
This Week in Logic at CUNY
Best,
- - - - Monday, Sep 4, 2023 - - - -
COLLEGE CLOSED - Labor Day
- - - - Tuesday, Sep 5, 2023 - - - -
- - - - Wednesday, Sep 06, 2023 - - - -
- - - - Thursday, Sep 07, 2023 - - - -
- - - - Friday, Sep 08, 2023 - - - -
CUNY Graduate Center
Hans Schoutens, CUNY
The model-theory of compact spaces
A more correct title would read: the model-theory of the category of compact (Hausdorff) spaces. Last year, I gave a talk about the model-theory of categories, and this talk will be its continuation (but I will repeat everything that is relevant) in which I will look at one special case: COMP, the category of compact spaces. Let C be any model that is elementary equivalent to the category COMP (but if you’re a standard guy, you can just take C=COMP and everything is still interesting). The model C 'remembers' the topology of each of its objects (except we might have lost compactness). But it can recover much more, to an extent that I would almost call it 'foundational'. I will show how to reconstruct a model of PA, a model of the ORD (ordinals) and even a model of ZFC. If you wonder, which model of ZFC you get if you just start with COMP, the answer is: the same you woke up to this morning!
Next Week in Logic at CUNY:
- - - - Monday, Sep 11, 2023 - - - -
Logic and Metaphysics Workshop
Date: Monday, Sept 11, 4.15-6.15pm (NY time)
For meeting information, please sign up for our mailing list at https://logic.commons.gc.cuny.edu/about/
Francesco Paoli, Cagliari
Title: Logical metainferentialism
Abstract: Logical inferentialism is the view that the meaning of the logical constants is determined by the rules of inference that govern their behaviour in proofs – in particular, sequent calculus proofs, according to the preferences of several recent authors. When it comes to the nuts and bolts, however, the view is tenable only if certain aspects – concerning e.g. harmony criteria for rules, normal forms, or proof-theoretic validity – are clarified. Sequent calculus inferentialists generally do so in terms of proofs from axioms, not of derivations from assumptions. Although the merits of this approach are already debatable in traditional settings, recent work on sequent calculi without Identity or Cut has revealed further shortcomings. Logical metainferentialism revises inferentialism in this more general perspective. In this talk, we will sketch the basics of this view and argue that, from this vantage point, the claim that LP is the “One True Logic” may appeal even to the inferentialistically inclined logician.
- - - - Tuesday, Sep 12, 2023 - - - -
- - - - Wednesday, Sep 13, 2023 - - - -
- - - - Thursday, Sep 14, 2023 - - - -
- - - - Web Site - - - -
Find us on the web at: nylogic.github.io
(site designed, built & maintained by Victoria Gitman)
-------- ADMINISTRIVIA --------
To subscribe/unsubscribe to this list, please email your request to jreitz@citytech.cuny.edu.
If you have a logic-related event that you would like included in future mailings, please email jreitz@citytech.cuny.edu.
(KGRC) talks for the upcoming semester
Wednesday seminar
Logic Seminar 5 Sept 2023 17:00 hrs at NUS by Sun Mengzhou
Logic Seminar 29 Aug 2023 17:00 hrs at NUS by Tran Chieu Minh
Fwd: Aviles
Od: Grzegorz Plebanek <grzegorz.plebanek@math.uni.wroc.pl>
Date: czw., 24 sie 2023 o 20:39
Subject: Aviles
To: Piotr Borodulin-Nadzieja <pborod@math.uni.wroc.pl>, Szymon Żeberski <szymon.zeberski@pwr.edu.pl>, Paweł Krupski <pawel.krupski@pwr.edu.pl>, Robert Rałowski <robert.ralowski@pwr.edu.pl>, Maciej Korpalski <Maciej.Korpalski@math.uni.wroc.pl>, Arturo Antonio Martínez Celis Rodríguez <amartinezcelis@gmail.com>, <sebastian.jachimek@math.uni.wroc.pl>, Tomasz Żuchowski <tomasz.artur.zuchowski@gmail.com>
Wednesday seminar
Wednesday seminar
Wednesday seminar
Wednesday seminar
Wednesday seminar
RIMS Set Theory Workshop: October 24-27, 2023
Wednesday seminar
(KGRC) two talks on Thursday, June 29
Nankai Logic Colloquium
(KGRC) two talks on Tuesday, June 20 and two talks on Thursday, June 22
Wednesday seminar
Conferencias del Seminario Colombo Mexicano de Teoría de Conjuntos 2023-I.
(KGRC) TU Wien Mini Workshop and two KGRC talks
Cross-Alps Logic Seminar (speaker: André Nies)
All the best,
Vincenzo
Set Theory and Topology Seminar 13.06.2023 Paweł Krupski
Paweł Krupski
(on behalf of the organizers, i.e. Piotr Borodulin-Nadzieja, Paweł Krupski, Aleksandra Kwiatkowska, Grzegorz Plebanek, Robert Rałowski and myself)
About 15 minutes before the seminar we invite you for coffee and a chat to social room A.4.1.A in C-19.
https://settheory.pwr.edu.pl/
http://www.math.uni.wroc.pl/seminarium/topologia
Nankai Logic Colloquium
Hello everyone,
This week our weekly Nankai Logic Colloquium is going to be in the morning.
Our speaker this week will be Shaun Allison from the University of Toronto. This talk is going to take place this Friday, June 9th, from 9am to 10am(UTC+8, Beijing time).
Abstract: A celebrated result of Gao-Jackson is that every equivalence relation induced by a Borel action of a countable abelian group is hyperfinite. Greg Hjorth asked if indeed every countable Borel equivalence relation that is Borel-reducible to an orbit equivalence relation induced by an abelian Polish group is hyperfinite. We prove that while the answer to Hjorth's question is "yes" in many situations, in fact every countable treeable Borel equivalence relation is classifiable by an abelian Polish group. Given that the free part of the Bernoulli shift action of F_2 is treeable but not hyperfinite, this answers Hjorth's question in the negative in general. The proof relies on a subtle property of a treeing which we call "stretched", as well as a free Banach space construction. We will spend much of the time explaining the context and all of the relevant definitions behind this result, and then we will give a sketch of the proof. We end with some suggestions for future directions.
__________________________________________________________________________________________________
Title :The 32nd Nankai Logic Colloquium --Shaun Allison
Time :9:00am, Jun. 9, 2023(Beijing Time)
Zoom Number :893 1745 8343
Passcode : 283146
Link :https://us02web.zoom.us/j/89317458343?pwd=L01Hc28yc0J2OGk3c3VPS3gvVjVndz09
_____________________________________________________________________
Best wishes,
Ming Xiao
Cross-Alps Logic Seminar (speaker: Ulrich Kohlenbach)
All the best,
Vincenzo
Nankai Logic Colloquium
Hello everyone,
This week our weekly Nankai Logic Colloquium is going to be in the afternoon.
Our speaker this week will be Dominik Kwietniak from Jagiellonian University. This talk is going to take place this Friday, June 2nd, from 4pm to 5pm(UTC+8, Beijing time).
Title: An anti-classification theorem for the topological conjugacy problem for Cantor minimal systems Abstract: The isomorphism problem in dynamics dates back to a question of von Neumann from 1932: Is it possible to classify (in some reasonable sense) the ergodic measure-preserving diffeomorphisms of a compact manifold up to isomorphism? We would like to study a similar problem: let C be the Cantor set and let Min(C) stand for the space of all minimal homeomorphisms of the Cantor set. Recall that a Cantor set homeomorphism T is in Min(C) if every orbit of T is dense in C. We say that S and T in Min(C) are topologically conjugate if there exists a Cantor set homeomorphism h such that Sh=hT. We prove an anti-classification result showing that even for very liberal interpretations of what a "reasonable'' classification scheme might be, a classification of minimal Cantor set homeomorphism up to topological conjugacy is impossible. We see is as a consequence of the following: we prove that the topological conjugacy relation of Cantor minimal systems TopConj treated as a subset of Min(C) x Min(C) is complete analytic. In particular, TopConj is a non-Borel subset of Min(C) x Min(C). Roughly speaking, it means that it is impossible to tell if two minimal Cantor set homeomorphisms are topologically conjugate using only a countable amount of information and computation. Our result is proved by applying a Foreman-Rudolph-Weiss-type construction used for an anti-classification theorem for ergodic automorphisms of the Lebesgue space. We find a continuous map F from the space of all subtrees over non-negative integers N with arbitrarily long branches into the class of minimal homeomorphisms of the Cantor set. Furthermore, F is a reduction, which means that a tree T is ill-founded if and only if F(T) is topologically conjugate to its inverse. Since the set of ill-founded trees with arbitrarily long branches is a well-known example of a complete analytic set, we see that it is essentially impossible to classify which minimal Cantor set homeomorphisms are topologically conjugate to their inverses. This is joint work with Konrad Deka, Felipe García-Ramos, Kosma Kapsrzak, Philipp Kunde (all from the Jagiellonian University in Kraków).
__________________________________________________________________________________________________
Title :The 31st Nankai Logic Colloquium --Dominik Kwietniak
Time :16:00pm, Jun. 2, 2023(Beijing Time)
Zoom Number : 876 3579 6414
Passcode : 318535
Link :https://us02web.zoom.us/j/87635796414?pwd=M1hZSEFvL0FzMUZQcHVCQ0w2QlhtUT09
_____________________________________________________________________
Best wishes,
Ming Xiao
Set Theory and Topology Seminar 6.06.2023 Piotr Szewczak (UKSW)
Piotr Szewczak (UKSW)
(on behalf of the organizers, i.e. Piotr Borodulin-Nadzieja, Paweł Krupski, Aleksandra Kwiatkowska, Grzegorz Plebanek, Robert Rałowski and myself)
Abstract
A set of reals X is Menger if for any countable sequence of open covers of X one can pick finitely many elements from every cover in the sequence such that the chosen sets cover X. Any set of reals of cardinality smaller than the dominating number d is Menger and there is a non-Menger set of cardinality d. By the result of Bartoszyński and Tsaban, in ZFC, there is a totally imperfect (with no copy of the Cantor set inside) Menger set of cardinality d. We solve a problem, whether there is such a set of cardinality continuum. Using an iterated Sacks forcing and topological games we prove that it is consistent with ZFC that d<c and each totally imperfect Meneger set has cardinality less or equal than d.
This is a joint work with Valentin Haberl and Lyubomyr Zdomskyy.
The research was funded by the National Science Centre, Poland and the Austrian Science Found under the Weave-UNISONO call in the Weave programme, project: Set-theoretic aspects of topological selections 2021/03/Y/ST1/00122.
About 15 minutes before the seminar we invite you for coffee and a chat to social room A.4.1.A in C-19.
https://settheory.pwr.edu.pl/
http://www.math.uni.wroc.pl/seminarium/topologia
Nankai Logic Colloquium
Hello everyone,
This week our weekly Nankai Logic Colloquium is going to be in the afternoon.
Our speaker this week will be Liuzhen Wu from the Academy of Mathematical and Systems Sciences, CAS. This talk is going to take place this Friday, May 26th, from 4pm to 5pm(UTC+8, Beijing time).
title: Definability of the nonstationary ideal on $\omega_1$
abstract: The nonstationary ideals are natural nontrivial ideals defined on all uncountable regular cardinals. In this talk, various aspects of definability of nonstationary ideals on uncountable cardinals are explored. The main focus is the definability of nonstationary ideal on $\omega_1$ ($NS_{\omega_1}$ for short) in some canonical models of set theory. In particular, under MM or (*) axiom, $NS_{\omega_1}$ is not $\Pi_1$ definable. On the other hand, it is consistent that in some model of $PFA$, $NS_{\omega_1}$ is $\Pi_1$ definable. This is based on the accumulated work of Aspero, Hoffelner, Larson, Schindler, Sun, Wu.
__________________________________________________________________________________________________
Title : The 30th Nankai Logic Colloquium --Liuzhen Wu
Time :16:00pm, May. 26, 2023 (Beijing Time)
Zoom Number : 851 5601 8255
Passcode : 136440
Link :https://us02web.zoom.us/j/85156018255?pwd=UjFUb3cwT0poY0JYakRub2kyNGdSdz09
Best wishes,
Ming Xiao
Set Theory and Topology Seminar 30.05.2023 Zbigniew Lipecki
Zbigniew Lipecki (IM PAN)
(on behalf of the organizers, i.e. Piotr Borodulin-Nadzieja, Paweł Krupski, Aleksandra Kwiatkowska, Grzegorz Plebanek, Robert Rałowski and myself)
Abstract
The space in question is the space $\textfrak M$ of Lebesgue measurable subsets of the unit interval equipped with the usual Fr'echet--Nikodym (semi)metric. We show that there exists a sequence of elements of $\textfrak M$ such that their mutual distances are > 1/2. It seems to be an open problem whether "1/2" can be replaced here by a bigger constant C. We show that C must be smaller than 9/14. Moreover, we present a version of the problem in terms of binary codes.
About 15 minutes before the seminar we invite you for coffee and a chat to social room A.4.1.A in C-19.
https://settheory.pwr.edu.pl/
http://www.math.uni.wroc.pl/seminarium/topologia
Charla de Justin Moore en el Seminario Colombo Mexicano de Teoría de Conjuntos
Seminario Colombo Mexicano de Teoría de Conjuntos
May 25
4:00 p.m. - 5:00 p.m. (Colombia time)
Zoom meeting information.
Meeting ID: 856 1882 0721
Passcode: 123456
https://cuaieed-unam.zoom.us/j/85618820721
This Week in Logic at CUNY
- - - - Tuesday, May 23, 2023 - - - -
MAMLS Spring Fling at Rutgers University
The MAMLS Spring Fling meeting will take place May 23-26 at Rutgers University, New Brunswick, New Jersey. More information about the meeting can be found on its website (https://sites.math.rutgers.edu/~fc327/MAMLS2023/index.html). Registration is free and everyone who plans to attend is encouraged to register for logistics purposes.
- - - - Wednesday, May 24, 2023 - - - -
- - - - Thursday, May 25, 2023 - - - -
- - - - Friday, May 26, 2023 - - - -
- - - - Web Site - - - -
Find us on the web at: nylogic.github.io
(site designed, built & maintained by Victoria Gitman)
-------- ADMINISTRIVIA --------
To subscribe/unsubscribe to this list, please email your request to jreitz@citytech.cuny.edu.
If you have a logic-related event that you would like included in future mailings, please email jreitz@citytech.cuny.edu.
(KGRC) four talks, long and short
Set Theory and Topology Seminar 23.05.2023 Barnabas Farkas
Barnabas Farkas (TU Wien)
(on behalf of the organizers, i.e. Piotr Borodulin-Nadzieja, Paweł Krupski, Aleksandra Kwiatkowska, Grzegorz Plebanek, Robert Rałowski and myself)
Abstract
About 15 minutes before the seminar we invite you for coffee and a chat to social room A.4.1.A in C-19.
https://settheory.pwr.edu.pl/
http://www.math.uni.wroc.pl/seminarium/topologia
Charla de Alfredo Zaragoza en el Seminario Colombo Mexicano de Teoría de Conjuntos
Seminario Colombo Mexicano de Teoría de Conjuntos
Mayo 18
4:00 p.m. - 5:00 p.m. (hora de Colombia)
Resumen. En general, si tenemos un espacio topológico X de dimensión uno, la dimensión de su hiperespacio de subconjuntos compactos K(X) con la topología de Vietoris no es finita. En esta plática presentamos varios ejemplos de espacios topológicos X de dimensión uno tales que la dimensión de su hiperespacio K(X) también es uno.
Zoom meeting information.
Meeting ID: 856 1882 0721
Passcode: 123456
https://cuaieed-unam.zoom.us/j/85618820721
Cross-Alps Logic Seminar (speaker: Jacques Duparc)
All the best,
Vincenzo
Nankai Logic Colloquium
Hello everyone,
This week our weekly Nankai Logic Colloquium is going to be in the afternoon.
Our speaker this week will be Guozhen Shen from Wuhan University. This talk is going to take place this Friday, May 19th, from 4pm to 5pm(UTC+8, Beijing time).
Title: A surjection from square onto power
Abstract: In 1892, Cantor proved that, for all sets $A$, there are no bijections between $A$ and the power set of $A$. Cantor's construction is so explicit that it can be carried out in ZF (the Zermelo--Fraenkel set theory without the axiom of choice). In 1906, by virtue of Zermelo's well-ordering theorem, Hessenberg proved the idempotency theorem, which states that there is a bijection between $A$ and the square of $A$ for all infinite sets $A$. (Another proof of the idempotency theorem was given by Zorn in 1944 using Zorn's lemma.) In 1924, Tarski proved that the idempotency theorem is in fact equivalent to the axiom of choice. On the other hand, in 1954, Specker proved in ZF a surprising generalization of Cantor's theorem, which states that, for all infinite sets $A$, there are no injections from the power set of $A$ into the square of $A$. It is then natural to ask whether it is provable in ZF that, for all infinite sets $A$, there are no surjections from the square of $A$ onto the power set of $A$. This question is known as the dual Specker problem and was proposed by Truss in 1973. In this talk, we give a negative answer to this question; that is, the existence of an infinite set $A$ such that the square of $A$ maps onto the power set of $A$ is consistent with ZF. This is joint work with Yinhe Peng and Liuzhen Wu.
__________________________________________________________________________________________________
Title :The 29th Nankai Logic Colloquium --Guozhen Shen
Time :16:00pm, May. 19, 2023 (Beijing Time)
Zoom Number :856 2849 0880
Passcode : 073635
Link :https://us02web.zoom.us/j/85628490880?pwd=dTBrV0NLc0l1bmFTY1RHR0d0TUNDZz09
Best wishes,
Ming Xiao
This Week in Logic at CUNY
Logic and Metaphysics Workshop
Date: Monday, May 15, 4.15-6.15pm (NY time), GC 9206
NOTE: Meetings this semester are in person only (no zoom)
For meeting information, please sign up for our mailing list at https://logic.commons.gc.cuny.edu/about/
Maciej Sendłak (Warsaw).
Title: Explanatory realism and counterfactuals
Abstract: In my talk, I want to propose a novel approach to the question of counterfactuals. This is grounded in two assumptions, imported from the philosophy of science. The first one has it that to explain a phenomenon is to show how it depends on something else. The second states that the correct explanation ought to be contrastive. This means that a good explanation justifies the occurrence of a phenomenon and – at the same time – excludes occurrence of some other states of affairs. I am going to argue that – together with the assumption that conditionals express a dependence relation between A and C – the above gives ground for analysis of counterfactuals. According to this proposal: “A>C” is true at the world of evaluation iff there is a relation of dependence that hold between referents of A and C, and the same relation of dependence holds in the world of evaluation.
- - - - Tuesday, May 16, 2023 - - - -
- - - - Wednesday, May 17, 2023 - - - -
Department of Computer Science
Department of Mathematics
The Graduate Center of The City University of New York
Speaker: Arthur Parzygnat, Nagoya University.
Date and Time: Wednesday May 17, 2023, 7:00 - 8:30 PM. IN PERSON TALK.
Title: Inferring the past and using category theory to define retrodiction.
Abstract: Classical retrodiction is the act of inferring the past based on knowledge of the present. The primary example is given by Bayes' rule P(y|x) P(x) = P(x|y) P(y), where we use prior information, conditional probabilities, and new evidence to update our belief of the state of some system. The question of how to extend this idea to quantum systems has been debated for many years. In this talk, I will lay down precise axioms for (classical and quantum) retrodiction using category theory. Among a variety of proposals for quantum retrodiction used in settings such as thermodynamics and the black hole information paradox, only one satisfies these categorical axioms. Towards the end of my talk, I will state what I believe is the main open question for retrodiction, formalized precisely for the first time. This work is based on the preprint https://arxiv.org/abs/2210.13531 and is joint work with Francesco Buscemi.
- - - - Thursday, May 18, 2023 - - - -
- - - - Friday, May 19, 2023 - - - -
CUNY Graduate Center
Friday, May 19, 12:30pm NY time
Virtual: Please email Victoria Gitman (vgitman@gmail.com) for meeting id.
Miha Habič, Bard College at Simon's Rock
Some old and new results on nonamalgamable forcing extensions
Fixing some countable transitive model of set theory, we can consider its generic multiverse, the family of all models obtainable from by taking any sequence of forcing extensions and ground models. There is an attractive similarity between the generic multiverse and the Turing degrees, but the multiverse has the drawback (or feature?) that it contains nonamalgamable models, that is, models with no common upper bound, as was observed by several people, going back to at least Mostowski. In joint work with Hamkins, Klausner, Verner, and Williams in 2019, we studied the order-theoretic properties of the generic multiverse and, among other results, gave a characterization of which partial orders embed nicely into the multiverse. I will present our results in the simplest case of Cohen forcing, as well as existing generalizations to wide forcing, and some new results on non-Cohen ccc forcings.
- - - - Monday, May 22, 2023 - - - -
- - - - Tuesday, May 23, 2023 - - - -
MAMLS Spring Fling at Rutgers University
The MAMLS Spring Fling meeting will take place May 23-26 at Rutgers University, New Brunswick, New Jersey. More information about the meeting can be found on its website (https://sites.math.rutgers.edu/~fc327/MAMLS2023/index.html). Registration is free and everyone who plans to attend is encouraged to register for logistics purposes.
- - - - Wednesday, May 24, 2023 - - - -
- - - - Thursday, May 25, 2023 - - - -
- - - - Friday, May 26, 2023 - - - -
- - - - Web Site - - - -
Find us on the web at: nylogic.github.io
(site designed, built & maintained by Victoria Gitman)
-------- ADMINISTRIVIA --------
To subscribe/unsubscribe to this list, please email your request to jreitz@citytech.cuny.edu.
If you have a logic-related event that you would like included in future mailings, please email jreitz@citytech.cuny.edu.
Applications of Set Theory, Lodz, Poland, September 4-8 2023
Nankai Logic Colloquium
lHello everyone,
This week our weekly Nankai Logic Colloquium is going to be in the afternoon.
Our speaker this week will be Maciej Malicki from Polish Academy of Sciences. This talk is going to take place this Friday, May 12th, from 4pm to 5pm(UTC+8, Beijing time).
Title: Continuous logic and equivalence relations
Abstract: We will discuss two applications of infinitary continuous logic to Borel complexity of equivalence relations. We will characterize in model-theoretic terms essentially countable isomorphism relations on Borel classes of locally compact Polish metric structures. This gives a new proof of Kechris' theorem that orbit equivalence relations of actions of Polish locally compact groups are essentially countable. We will also show that isomorphism on such classes is always Borel reducible to graph isomorphism. This immediately answers a question of Gao and Kechris whether isometry of locally compact Polish metric spaces is reducible to graph isomorphism. The first result is joint work with Andreas Hallbäck and Todor Tsankov.
__________________________________________________________________________________________________
Best wishes,
Ming Xiao
Charla de Jose Moncayo en el Seminario Colombo Mexicano de Teoría de Conjuntos
Seminario Colombo Mexicano de Teoría de Conjuntos
Mayo 11
4:00 p.m. - 5:00 p.m. (hora de Colombia)
Jose R. Moncayo
Universidad Nacional de Colombia
Resumen. En esta charla se expondrán diferentes construcciones conjuntistas que buscan generalizar los modelos V y L en lógicas residuadas.
Zoom meeting information.
Meeting ID: 856 1882 0721
Passcode: 123456
https://cuaieed-unam.zoom.us/j/85618820721
This Week in Logic at CUNY
Romina Birman, Paul Boghossian, Harry Field, Melvin
Fitting, Daniel Isaacson, Carl Posy, Robert Stalnaker
Reminiscences:
Eduardo Barrio, James Burgess, David Chalmers, Mircea
Dumitru, Margaret Gilbert, Anandi Hattiangadi, Antonella
Mallozzi, Oliver Marshall, Yiannis Moschovakis, Stephen
Neale, Gary Ostertag, David Papineau, Graham Priest, Scott
Soames, Larry Tribe, Timothy Williamson
With an introduction by:
Steve Everett, Provost and Senior Vice President, The CUNY Graduate Center
- - - - Tuesday, May 9, 2023 - - - -
Romina Birman, Paul Boghossian, Harry Field, Melvin
Fitting, Daniel Isaacson, Carl Posy, Robert Stalnaker
Reminiscences:
Eduardo Barrio, James Burgess, David Chalmers, Mircea
Dumitru, Margaret Gilbert, Anandi Hattiangadi, Antonella
Mallozzi, Oliver Marshall, Yiannis Moschovakis, Stephen
Neale, Gary Ostertag, David Papineau, Graham Priest, Scott
Soames, Larry Tribe, Timothy Williamson
With an introduction by:
Steve Everett, Provost and Senior Vice President, The CUNY Graduate Center
Tuesday, May 9, 1:00pm
Virtual (email Victoria Gitman vgitman@gmail.com for meeting id)
Mateusz Łełyk, University of Warsaw
Pathologies in Satisfaction Classes: part II
This is the second part of the talk given by Athar Abdul-Quader (Pathologically definable subsets of models of CT-), however we will make sure to make it self-contained.
The talk is centered around the following problem: when a subset of a countable and recursively saturated model M can be characterized as the set of the lengths of disjunctions on which a satisfaction class behaves correctly? More precisely: let DC(x) denote a sentence in a language of PA with a fresh binary predicate S which says 'For every disjunction d with at most x disjuncts and every assignment a, S(d,a) iff there is a disjunct d' in d such that S(d',a).' We say that X is a DC-set in (M,S) iff X is precisely the set of those numbers a such that (M,S) satisfies DC(a). We ask: given a countable and recursively saturated model M for which subsets X of M we can find a satisfaction class S such that X is a DC-set in (M,S)?
In the talk we study this problem for idempotent disjunctions, that is: disjunctions which repeat the same sentence. Let IDC(x) be DC(x) restricted to such 'idempotent' disjunctions of length x. The following is one of our core results:
Theorem: For an arbitrary countable and recursively saturated model M of PA the following conditions are equivalent:
(a) M is arithmetically saturated
(b) For every cut I in M there is a satisfaction class S such that I is an IDC-set in (M,S).
We study how this result generalizes to other propositional constructions in the place of disjunctions. The talk is based on a joint work with Athar Abdul-Quader presented in this paper from arxiv: arXiv:2303.18069v1 [math.LO] 31 Mar 2023.
- - - - Wednesday, May 10, 2023 - - - -
The Logic and Metaphysics Workshop special session
10:00-11:30: Heinrich Wansing (Bochum)
Title: Quantifiers in connexive logic (in general and in particular)
Abstract: Connexive logic has room for two pairs of universal and particular quantifiers: one pair are standard quantifiers; the other pair are unorthodox, but we argue, are well-motivated in the context of connexive logic. Both non-standard quantifiers have been introduced previously, but in the context of connexive logic they have a natural semantic and proof-theoretic place, and plausible natural language readings. The result are logics which are negation inconsistent but non-trivial.
Note: This is joint work with Zach Weber (Otago).
12:30-2:00: Daniel Skurt (Bochum)
Title: RNmatrices for modal logics
Abstract: In this talk we will introduce a semantics for modal logics, based on so-called restricted Nmatrices (RNmatrices). These RNmatrices, previously used in the context of paraconsistent logics, prove to be a versatile tool for generating semantics for normal and non-normal systems of modal logics. Each of these semantics have sound and complete Hilbert-style calculi. The advantage of RNmatrices is that they provide a unifying framework for modal logics with or without first-order Kripke-frame conditions.
Note: This is joint work with Marcelo Coniglio (Campinas) and Pawel Pawlowski (Ghent).
2:30-4:00: Mark Colyvan (Sydney/LMU)
Title: Explanatory and non-explanatory proofs in mathematics
Abstract: In this paper I look at the contrast between explanatory and non-explanatory proofs in mathematics. This is done with the aim of shedding light on what distinguishes the explanatory proofs. I argue that there may be more than one notion of explanation in operation in mathematics: there does not seem to be a single account that ties together the different explanatory proofs found in mathematics. I then attempt to give a characterization of the different notions of explanation in play and how these sit with accounts of explanation found in philosophy of science.
- - - - Thursday, May 11, 2023 - - - -
- - - - Friday, May 12, 2023 - - - -
CUNY Graduate Center
Brian Wynne, CUNY
Recent developments in the model theory of Abelian lattice-ordered groups
An Abelian lattice-ordered group (-group) is an Abelian group with a partial ordering, invariant under translations, that is a lattice ordering. A prototypical example of an -group is , the continuous real-valued functions on the topological space with pointwise operations and ordering. Let be the class of -groups, viewed as structures for the first-order language . After giving more background on -groups, I will survey what is known about the -groups existentially closed (e.c.) in , including some new examples I constructed using Fraïssé limits. Then I will discuss some recently published work of Scowcroft concerning the -groups e.c. in , the class of nonzero Archimedean -groups with distinguished strong order unit (viewed as structures for ). Building on Scowcroft's results, I will present new axioms for the -groups e.c. in and show how they allow one to characterize those spaces for which is e.c. in .
- - - - Monday, May 15, 2023 - - - -
Logic and Metaphysics Workshop
Date: Monday, May 15, 4.15-6.15pm (NY time), GC 9206
NOTE: Meetings this semester are in person only (no zoom)
For meeting information, please sign up for our mailing list at https://logic.commons.gc.cuny.edu/about/
Maciej Sendłak (Warsaw).
Title: Explanatory realism and counterfactuals
Abstract: In my talk, I want to propose a novel approach to the question of counterfactuals. This is grounded in two assumptions, imported from the philosophy of science. The first one has it that to explain a phenomenon is to show how it depends on something else. The second states that the correct explanation ought to be contrastive. This means that a good explanation justifies the occurrence of a phenomenon and – at the same time – excludes occurrence of some other states of affairs. I am going to argue that – together with the assumption that conditionals express a dependence relation between A and C – the above gives ground for analysis of counterfactuals. According to this proposal: “A>C” is true at the world of evaluation iff there is a relation of dependence that hold between referents of A and C, and the same relation of dependence holds in the world of evaluation.
- - - - Tuesday, May 16, 2023 - - - -
- - - - Wednesday, May 17, 2023 - - - -
Department of Computer Science
Department of Mathematics
The Graduate Center of The City University of New York
Speaker: Arthur Parzygnat, Nagoya University.
Date and Time: Wednesday May 17, 2023, 7:00 - 8:30 PM. IN PERSON TALK.
Title: Inferring the past and using category theory to define retrodiction.
Abstract: Classical retrodiction is the act of inferring the past based on knowledge of the present. The primary example is given by Bayes' rule P(y|x) P(x) = P(x|y) P(y), where we use prior information, conditional probabilities, and new evidence to update our belief of the state of some system. The question of how to extend this idea to quantum systems has been debated for many years. In this talk, I will lay down precise axioms for (classical and quantum) retrodiction using category theory. Among a variety of proposals for quantum retrodiction used in settings such as thermodynamics and the black hole information paradox, only one satisfies these categorical axioms. Towards the end of my talk, I will state what I believe is the main open question for retrodiction, formalized precisely for the first time. This work is based on the preprint https://arxiv.org/abs/2210.13531 and is joint work with Francesco Buscemi.
- - - - Thursday, May 18, 2023 - - - -
- - - - Friday, May 19, 2023 - - - -
CUNY Graduate Center
Friday, May 19, 12:30pm NY time
Virtual: Please email Victoria Gitman (vgitman@gmail.com) for meeting id.
Miha Habič, Bard College at Simon's Rock
Some old and new results on nonamalgamable forcing extensions
Fixing some countable transitive model of set theory, we can consider its generic multiverse, the family of all models obtainable from by taking any sequence of forcing extensions and ground models. There is an attractive similarity between the generic multiverse and the Turing degrees, but the multiverse has the drawback (or feature?) that it contains nonamalgamable models, that is, models with no common upper bound, as was observed by several people, going back to at least Mostowski. In joint work with Hamkins, Klausner, Verner, and Williams in 2019, we studied the order-theoretic properties of the generic multiverse and, among other results, gave a characterization of which partial orders embed nicely into the multiverse. I will present our results in the simplest case of Cohen forcing, as well as existing generalizations to wide forcing, and some new results on non-Cohen ccc forcings.
- - - - Web Site - - - -
Find us on the web at: nylogic.github.io
(site designed, built & maintained by Victoria Gitman)
-------- ADMINISTRIVIA --------
To subscribe/unsubscribe to this list, please email your request to jreitz@citytech.cuny.edu.
If you have a logic-related event that you would like included in future mailings, please email jreitz@citytech.cuny.edu.
(KGRC) Set Theory Seminar talk on TUESDAY, May 9
Wednesday seminar
Logic Seminar 10 May 2023 17:00 hrs at NUS by Jan Baars
Cross-Alps Logic Seminar (speaker: Dima Sinapova)
All the best,
Vincenzo
Charla de Joel Aguilar en el Seminario Colombo Mexicano de Teoría de Conjuntos
Seminario Colombo Mexicano de Teoría de Conjuntos
Mayo 4
4:00 p.m. - 5:00 p.m. (hora de Colombia)
Subespacios "grandes" de C_p(X) y sus invariantes cardinales
Joel Aguilar
Universidad Michoacana de San Nicolás de Hidalgo
Resumen. Sea C_p(X) el espacio de funciones continuas de X en R con la topología de la convergencia puntual (para garantizar que C_p(X) sea no trivial en esta plática asumiremos que todos los espacios estudiados son de Tychonoff). Una técnica común para obtener información de un espacio X es estudiar las propiedades de sus subespacios "suficientemente grandes"; por ejemplo, un espacio con un subespacio denso y psuedocompacto tiene que ser pseudocompacto; un espacio no puede ser de Lindelöf si tiene un subespacio no-numerable, discreto y cerrado; etc. En la plática nos enfocaremos en los subespacios de C_p(X) que también son densos en la topología uniforme y discutiremos cómo se relacionan las propiedades de estos subespacios con las de C_p(X).
Zoom meeting information.
Meeting ID: 856 1882 0721
Passcode: 123456
https://cuaieed-unam.zoom.us/
Nankai Logic Colloquium
Hello everyone,
Sorry for the interrupting again. I would like to apologize(again) for a mistake in the previous announcement. There was a serious mistake in the time mentioned. The correct time of the Nankai Logic Colloquium this week is in the afternoon, 4pm to 5pm (instead of morning mentioned in the last email), Friday Beijing time. I am very very sorry for the confuse it may cause.
The following is a corrected version of the announcement for this week:
_____________________________________________________
This week our weekly Nankai Logic Colloquium is going to be in the afternoon.
Our speaker this week will be Ilijas Farah from York University. This talk is going to take place this Friday, May 5th, from 4pm to 5pm(UTC+8, Beijing time).
Title: Corona rigidity
Abstract. Reduced powers associated with the Frech\'et filter are well-known to be countably saturated (that is, $\aleph_1$-saturated). Because of this the Continuum Hypothesis implies that the reduced power of every countable structure has $2^{2^{\aleph_0}}$ automorphisms, and that for such reduced powers elementary equivalence is a sufficient condition for isomorphism. On the other hand, forcing axioms imply that some reduced powers (e.g., those of finite Boolean algebras) have only trivial automorphisms while some other reduced powers are saturated and they $2^{2^{\aleph_0}}$ automorphisms, provably in ZFC (e.g., those of the 2-element cyclic group).
This begs two questions: Which structures have saturated reduced powers, provably in ZFC? For which structures forcing axioms imply the `corona rigidity', that their reduced powers have only trivial automorphisms?
I will give a complete answer to the first question and a partial (rather surprising) answer to the second.
__________________________________________________________________________________________________
Best wishes,
Ming Xiao
Wednesday seminar
Nankai Logic Colloquium
Hello everyone,
I would like to apologize for a mistake in the previous announcement. There was a typo in the time mentioned. The correct time is 9am to 10am (instead of 10pm). I am very sorry for the confuse it may cause.
The following is a corrected version of the previous email:
_____________________________________________________
This week our weekly Nankai Logic Colloquium is going to be in the morning.
Our speaker this week will be Ilijas Farah from York University. This talk is going to take place this Friday, May 5th, from 9am to 10am(UTC+8, Beijing time).
Title: Corona rigidity
Abstract. Reduced powers associated with the Frech\'et filter are well-known to be countably saturated (that is, $\aleph_1$-saturated). Because of this the Continuum Hypothesis implies that the reduced power of every countable structure has $2^{2^{\aleph_0}}$ automorphisms, and that for such reduced powers elementary equivalence is a sufficient condition for isomorphism. On the other hand, forcing axioms imply that some reduced powers (e.g., those of finite Boolean algebras) have only trivial automorphisms while some other reduced powers are saturated and they $2^{2^{\aleph_0}}$ automorphisms, provably in ZFC (e.g., those of the 2-element cyclic group).
This begs two questions: Which structures have saturated reduced powers, provably in ZFC? For which structures forcing axioms imply the `corona rigidity', that their reduced powers have only trivial automorphisms?
I will give a complete answer to the first question and a partial (rather surprising) answer to the second.
__________________________________________________________________________________________________
Best wishes,
Ming Xiao
Nankai Logic Colloquium
Hello everyone,
This week our weekly Nankai Logic Colloquium is going to be in the morning.
Our speaker this week will be Ilijas Farah from York University. This talk is going to take place this Friday, May 5th, from 9am to 10pm(UTC+8, Beijing time).
Title: Corona rigidity
Abstract. Reduced powers associated with the Frech\'et filter are well-known to be countably saturated (that is, $\aleph_1$-saturated). Because of this the Continuum Hypothesis implies that the reduced power of every countable structure has $2^{2^{\aleph_0}}$ automorphisms, and that for such reduced powers elementary equivalence is a sufficient condition for isomorphism. On the other hand, forcing axioms imply that some reduced powers (e.g., those of finite Boolean algebras) have only trivial automorphisms while some other reduced powers are saturated and they $2^{2^{\aleph_0}}$ automorphisms, provably in ZFC (e.g., those of the 2-element cyclic group).
This begs two questions: Which structures have saturated reduced powers, provably in ZFC? For which structures forcing axioms imply the `corona rigidity', that their reduced powers have only trivial automorphisms?
I will give a complete answer to the first question and a partial (rather surprising) answer to the second.
__________________________________________________________________________________________________
Best wishes,
Ming Xiao
This Week in Logic at CUNY
Logic and Metaphysics Workshop
Date: Monday, May 1, 4.15-6.15pm (NY time), GC 9206
NOTE: Meetings this semester are in person only (no zoom)
For meeting information, please sign up for our mailing list at https://logic.commons.gc.cuny.edu/about/
Title: Understanding (and) surveyability
Abstract: In this talk I will discuss the notion of surveyable proof. Discussions of surveyability emerge periodically in recent philosophical literature, but the notion of surveyable proof can be traced back to Descartes. Despite this long history, there is still disagreement about what features a proof must have in order to count as surveyable. This disagreement arises, in part, because there is still significant vagueness regarding the problem that unsurveyability poses for the epistemology of mathematics. I identify three features of justification in mathematics that could be at issue in the surveyability debate: a priority, internalism, and certainty. Each of these features is prima facie troubled by unsurveyable proof. In each case, however, I’ll argue that unsurveyable proof does not pose any real issue. I will suggest that the surveyability debate should not be framed in terms of justification at all, and that the problem is really about mathematical understanding.
- - - - Tuesday, May 2, 2023 - - - -
- - - - Wednesday, May 3, 2023 - - - -
Department of Computer Science
Department of Mathematics
The Graduate Center of The City University of New York
Speaker: Gemma De las Cuevas, University of Innsbruck.
Date and Time: Wednesday May 3, 2023, 7:00 - 8:30 PM. ZOOM TALK.
Title: A framework for universality across disciplines.
Abstract: What is the scope of universality across disciplines? And what is its relation to undecidability? To address these questions, we build a categorical framework for universality. Its instances include Turing machines, spin models, and others. We introduce a hierarchy of universality and argue that it distinguishes universal Turing machines as a non-trivial form of universality. We also outline the relation to undecidability by drawing a connection to Lawvere’s Fixed Point Theorem. Joint work with Sebastian Stengele, Tobias Reinhart and Tomas Gonda.
- - - - Thursday, May 4, 2023 - - - -
- - - - Friday, May 5, 2023 - - - -
CUNY Graduate Center
Virtual: Please email Victoria Gitman (vgitman@gmail.com) for meeting id.
Realizing Frege's Basic Law V, provably in ZFC
The standard set-theoretic distinction between sets and classes instantiates in important respects the Fregean distinction between objects and concepts, for in set theory we commonly take the universe of sets as a realm of objects to be considered under the guise of diverse concepts, the definable classes, each serving as a predicate on that domain of individuals. Although it is commonly held that in a very general manner, there can be no association of classes with objects in a way that fulfills Frege's Basic Law V, nevertheless, in the ZF framework, it turns out that we can provide a completely deflationary account of this and other Fregean abstraction principles. Namely, there is a mapping of classes to objects, definable in set theory in senses I shall explain (hence deflationary), associating every first-order parametrically definable class with a set object , in such a way that Basic Law V is fulfilled:
Russell's elementary refutation of the general comprehension axiom, therefore, is improperly described as a refutation of Basic Law V itself, but rather refutes Basic Law V only when augmented with powerful class comprehension principles going strictly beyond ZF. The main result leads also to a proof of Tarski's theorem on the nondefinability of truth as a corollary to Russell's argument. A central goal of the project is to highlight the issue of definability and deflationism for the extension assignment problem at the core of Fregean abstraction.
CUNY Graduate Center
Classification via effective lists
'Classifying' a natural collection of structures is a common goal in mathematics. Providing a classification can mean different things, e.g., identifying a set of invariants that settle the isomorphism problem or creating a list of all structures of a given kind without repetition of isomorphism type. Here we discuss recent work on classifications of the latter kind from the perspective of computable structure theory. We’ll consider natural classes of computable structures such as vector spaces, equivalence relations, algebraic fields, and trees to better understand the nuances of classification via effective lists and its relationship to other forms of classification in this setting.
- - - - Monday, May 8, 2023 - - - -
Romina Birman, Paul Boghossian, Harry Field, Melvin
Fitting, Daniel Isaacson, Carl Posy, Robert Stalnaker
Reminiscences:
Eduardo Barrio, James Burgess, David Chalmers, Mircea
Dumitru, Margaret Gilbert, Anandi Hattiangadi, Antonella
Mallozzi, Oliver Marshall, Yiannis Moschovakis, Stephen
Neale, Gary Ostertag, David Papineau, Graham Priest, Scott
Soames, Larry Tribe, Timothy Williamson
With an introduction by:
Steve Everett, Provost and Senior Vice President, The CUNY Graduate Center
- - - - Tuesday, May 9, 2023 - - - -
Romina Birman, Paul Boghossian, Harry Field, Melvin
Fitting, Daniel Isaacson, Carl Posy, Robert Stalnaker
Reminiscences:
Eduardo Barrio, James Burgess, David Chalmers, Mircea
Dumitru, Margaret Gilbert, Anandi Hattiangadi, Antonella
Mallozzi, Oliver Marshall, Yiannis Moschovakis, Stephen
Neale, Gary Ostertag, David Papineau, Graham Priest, Scott
Soames, Larry Tribe, Timothy Williamson
With an introduction by:
Steve Everett, Provost and Senior Vice President, The CUNY Graduate Center
Tuesday, May 9, 1:00pm
Virtual (email Victoria Gitman vgitman@gmail.com for meeting id)
Mateusz Łełyk, University of Warsaw
Pathologies in Satisfaction Classes: part II
This is the second part of the talk given by Athar Abdul-Quader (Pathologically definable subsets of models of CT-), however we will make sure to make it self-contained.
The talk is centered around the following problem: when a subset of a countable and recursively saturated model M can be characterized as the set of the lengths of disjunctions on which a satisfaction class behaves correctly? More precisely: let DC(x) denote a sentence in a language of PA with a fresh binary predicate S which says 'For every disjunction d with at most x disjuncts and every assignment a, S(d,a) iff there is a disjunct d' in d such that S(d',a).' We say that X is a DC-set in (M,S) iff X is precisely the set of those numbers a such that (M,S) satisfies DC(a). We ask: given a countable and recursively saturated model M for which subsets X of M we can find a satisfaction class S such that X is a DC-set in (M,S)?
In the talk we study this problem for idempotent disjunctions, that is: disjunctions which repeat the same sentence. Let IDC(x) be DC(x) restricted to such 'idempotent' disjunctions of length x. The following is one of our core results:
Theorem: For an arbitrary countable and recursively saturated model M of PA the following conditions are equivalent:
(a) M is arithmetically saturated
(b) For every cut I in M there is a satisfaction class S such that I is an IDC-set in (M,S).
We study how this result generalizes to other propositional constructions in the place of disjunctions. The talk is based on a joint work with Athar Abdul-Quader presented in this paper from arxiv: arXiv:2303.18069v1 [math.LO] 31 Mar 2023.
- - - - Wednesday, May 10, 2023 - - - -
The Logic and Metaphysics Workshop special session
10:00-11:30: Heinrich Wansing (Bochum)
Title: Quantifiers in connexive logic (in general and in particular)
Abstract: Connexive logic has room for two pairs of universal and particular quantifiers: one pair are standard quantifiers; the other pair are unorthodox, but we argue, are well-motivated in the context of connexive logic. Both non-standard quantifiers have been introduced previously, but in the context of connexive logic they have a natural semantic and proof-theoretic place, and plausible natural language readings. The result are logics which are negation inconsistent but non-trivial.
Note: This is joint work with Zach Weber (Otago).
12:30-2:00: Daniel Skurt (Bochum)
Title: RNmatrices for modal logics
Abstract: In this talk we will introduce a semantics for modal logics, based on so-called restricted Nmatrices (RNmatrices). These RNmatrices, previously used in the context of paraconsistent logics, prove to be a versatile tool for generating semantics for normal and non-normal systems of modal logics. Each of these semantics have sound and complete Hilbert-style calculi. The advantage of RNmatrices is that they provide a unifying framework for modal logics with or without first-order Kripke-frame conditions.
Note: This is joint work with Marcelo Coniglio (Campinas) and Pawel Pawlowski (Ghent).
2:30-4:00: Mark Colyvan (Sydney/LMU)
Title: Explanatory and non-explanatory proofs in mathematics
Abstract: In this paper I look at the contrast between explanatory and non-explanatory proofs in mathematics. This is done with the aim of shedding light on what distinguishes the explanatory proofs. I argue that there may be more than one notion of explanation in operation in mathematics: there does not seem to be a single account that ties together the different explanatory proofs found in mathematics. I then attempt to give a characterization of the different notions of explanation in play and how these sit with accounts of explanation found in philosophy of science.
- - - - Thursday, May 11, 2023 - - - -
- - - - Friday, May 12, 2023 - - - -
CUNY Graduate Center
Brian Wynne, CUNY
Recent developments in the model theory of Abelian lattice-ordered groups
An Abelian lattice-ordered group (-group) is an Abelian group with a partial ordering, invariant under translations, that is a lattice ordering. A prototypical example of an -group is , the continuous real-valued functions on the topological space with pointwise operations and ordering. Let be the class of -groups, viewed as structures for the first-order language . After giving more background on -groups, I will survey what is known about the -groups existentially closed (e.c.) in , including some new examples I constructed using Fraïssé limits. Then I will discuss some recently published work of Scowcroft concerning the -groups e.c. in , the class of nonzero Archimedean -groups with distinguished strong order unit (viewed as structures for ). Building on Scowcroft's results, I will present new axioms for the -groups e.c. in and show how they allow one to characterize those spaces for which is e.c. in .
CONFERENCE ANNOUNCEMENT
- - - - Web Site - - - -
Find us on the web at: nylogic.github.io
(site designed, built & maintained by Victoria Gitman)
-------- ADMINISTRIVIA --------
To subscribe/unsubscribe to this list, please email your request to jreitz@citytech.cuny.edu.
If you have a logic-related event that you would like included in future mailings, please email jreitz@citytech.cuny.edu.
(KGRC) two talks on Thursday, May 4
Charla de Diana Montoya en el Seminario Colombo Mexicano de Teoría de Conjuntos
Seminario Colombo Mexicano de Teoría de Conjuntos
Abril 27
4:00 p.m. - 5:00 p.m. (hora de Colombia)
Universidad Técnica de Viena
Resumen. En la primera parte de esta charla, presentaré la motivación y algunos resultados generales de la teoría de cardinales característicos en los espacios de Baire generalizados $\kappa^\kappa$; asimismo, presentaré un resumen del estado del arte actual de este tema. En la segunda parte, me enfocaré en el concepto de independencia maximal en estos espacios para el caso en el cual $\kappa$ es un cardinal regular (medible), y también en el caso en el que $\kappa$ es singular. Al final, mencionaré algunas preguntas abiertas y futuras líneas de investigación.
Nankai Logic Colloquium
Hello everyone,
This week our weekly Nankai Logic Colloquium is going to be in the morning.
Our speaker this week will be Ronnie Chen from the University of Michigan. This talk is going to take place this Friday, Apr 28th, from 9am to 10pm(UTC+8, Beijing time).
Title: Topology versus Borel structure for actions
Abstract: A "nice" (e.g., Polish) topology contains a lot more structure than its induced Borel $\sigma$-algebra. On the other hand, Pettis's theorem says that a Polish group topology is completely determined by its induced Borel group structure. The Becker--Kechris theorem interpolates between these two extreme behaviors in the context of group actions, by characterizing the compatible topologies on a Borel $G$-space. We give a new proof of a strengthened version of the core ingredient in the Becker--Kechris theorem, that clarifies its connection to several other results in the theory of Polish group actions, as well as generalizing cleanly to other contexts such as non-Hausdorff spaces, Borel first-order $G$-structures, and groupoid actions.
__________________________________________________________________________________________________
Time :9:00am, Apr. 28, 2023 (Beijing Time)
Zoom Number : 840 0998 2925
Passcode : 553830
Best wishes,
Ming Xiao
This Week in Logic at CUNY
Date: Monday, April 24, 4.15-6.15pm (NY time), GC 9206
NOTE: Meetings this semester are in person only (no zoom)
For meeting information, please sign up for our mailing list at https://logic.commons.gc.cuny.edu/about/
Title: Inferentialism and connexivity
Abstract: In my talk I will investigate the relationships between two claims about conditionals that by and large are discussed separately. One is the claim that a conditional holds when its consequent can be inferred from its antecedent, or when the latter provides a reason for accepting the former. The other is the claim that conditionals intuitively obey some characteristic connexive principles, such as Aristotle’s Thesis and Boethius Thesis. Following a line of thought that goes back to Chrysippus, I will suggest that these two claims may coherently be understood as distinct manifestations of a single basic idea, namely, that a conditional holds when its antecedent is incompatible with the negation of its consequent. The account of conditionals that I will outline is based precisely on this idea.
- - - - Tuesday, Apr 25, 2023 - - - -
Models of Peano Arithmetic (MOPA)
Tuesday, April 25, 1:00pm
Virtual (email Victoria Gitman vgitman@gmail.com for meeting id)
Pathologies in Satisfaction Classes
This is the second part of the talk given by Athar Abdul-Quader (Pathologically definable subsets of models of CT-), however we will make sure to make it self-contained.
The talk is centered around the following problem: when a subset of a countable and recursively saturated model M can be characterized as the set of the lengths of disjunctions on which a satisfaction class behaves correctly? More precisely: let DC(x) denote a sentence in a language of PA with a fresh binary predicate S which says 'For every disjunction d with at most x disjuncts and every assignment a, S(d,a) iff there is a disjunct d' in d such that S(d',a).' We say that X is a DC-set in (M,S) iff X is precisely the set of those numbers a such that (M,S) satisfies DC(a). We ask: given a countable and recursively saturated model M for which subsets X of M we can find a satisfaction class S such that X is a DC-set in (M,S)?
In the talk we study this problem for idempotent disjunctions, that is: disjunctions which repeat the same sentence. Let IDC(x) be DC(x) restricted to such 'idempotent' disjunctions of length x. The following is one of our core results:
Theorem: For an arbitrary countable and recursively saturated model M of PA the following conditions are equivalent:
(a) M is arithmetically saturated
(b) For every cut I in M there is a satisfaction class S such that I is an IDC-set in (M,S).
We study how this result generalizes to other propositional constructions in the place of disjunctions. The talk is based on a joint work with Athar Abdul-Quader presented in this paper from arxiv: arXiv:2303.18069v1 [math.LO] 31 Mar 2023.
- - - - Wednesday, Apr 26, 2023 - - - -
Department of Computer Science
Department of Mathematics
The Graduate Center of The City University of New York
Speaker: Dusko Pavlovic, University of Hawai‘i at Mānoa.
Date and Time: Wednesday April 26, 2023, 7:00 - 8:30 PM. ZOOM TALK.
Title: Program-closed categories.
Abstract: > Let CC be a symmetric monoidal category with a comonoid on every object. Let CC* be the cartesian subcategory with the same objects and just the comonoid homomorphisms. A *programming language* is a well-ordered object P with a *program closure*: a family of X-natural surjections
CC(XA,B) <<--run_X-- CC*(X,P)
one for every pair A,B. In this talk, I will sketch a proof that program closure is a property: Any two programming languages are isomorphic along run-preserving morphisms. The result counters Kleene's interpretation of the Church-Turing Thesis, which has been formalized categorically as the suggestion that computability is a structure, like a group presentation, and not a property, like completeness. We prove that it is like completeness. The draft of a book on categorical computability is available from the web site dusko.org.
- - - - Thursday, Apr 27, 2023 - - - -
- - - - Friday, Apr 28, 2023 - - - -
CUNY Graduate Center
Virtual: Please email Victoria Gitman (vgitman@gmail.com) for meeting id.
- - - - Monday, May 1, 2023 - - - -
- - - - Tuesday, May 2, 2023 - - - -
- - - - Wednesday, May 3, 2023 - - - -
Department of Computer Science
Department of Mathematics
The Graduate Center of The City University of New York
Speaker: Gemma De las Cuevas, University of Innsbruck.
Date and Time: Wednesday May 3, 2023, 7:00 - 8:30 PM. ZOOM TALK.
Title: A framework for universality across disciplines.
Abstract: What is the scope of universality across disciplines? And what is its relation to undecidability? To address these questions, we build a categorical framework for universality. Its instances include Turing machines, spin models, and others. We introduce a hierarchy of universality and argue that it distinguishes universal Turing machines as a non-trivial form of universality. We also outline the relation to undecidability by drawing a connection to Lawvere’s Fixed Point Theorem. Joint work with Sebastian Stengele, Tobias Reinhart and Tomas Gonda.
- - - - Thursday, May 4, 2023 - - - -
- - - - Friday, May 5, 2023 - - - -
CUNY Graduate Center
Virtual: Please email Victoria Gitman (vgitman@gmail.com) for meeting id.
CUNY Graduate Center
Classification via effective lists
'Classifying' a natural collection of structures is a common goal in mathematics. Providing a classification can mean different things, e.g., identifying a set of invariants that settle the isomorphism problem or creating a list of all structures of a given kind without repetition of isomorphism type. Here we discuss recent work on classifications of the latter kind from the perspective of computable structure theory. We’ll consider natural classes of computable structures such as vector spaces, equivalence relations, algebraic fields, and trees to better understand the nuances of classification via effective lists and its relationship to other forms of classification in this setting.
CONFERENCE ANNOUNCEMENT
- - - - Web Site - - - -
Find us on the web at: nylogic.github.io
(site designed, built & maintained by Victoria Gitman)
-------- ADMINISTRIVIA --------
To subscribe/unsubscribe to this list, please email your request to jreitz@citytech.cuny.edu.
If you have a logic-related event that you would like included in future mailings, please email jreitz@citytech.cuny.edu.
(KGRC) talks in the Set Theory Seminar on April 25 and April 27
Wednesday seminar -- joint seminar of the MLTCS department
Charla de Andrés Uribe en el Seminario Colombo Mexicano de Teoría de Conjuntos
Seminario Colombo Mexicano de Teoría de Conjuntos
Abril 20
4:00 p.m. - 5:00 p.m. (hora de Colombia)
Universidad Nacional de Colombia
Resumen. En el año 2000, Shelah logró demostrar que, consistentemente, el número de cubrimiento del ideal de los subconjuntos nulos de los números reales puede tener cofinalidad contable. Para ello, usando random forcing, construyó una iteración de soporte finito con medidas finitamente aditivas. En esta charla se va a presentar la definición de una nueva noción de ligadura, llamada FAM-ligadura, que permite generalizar la iteración que Shelah introdujo originalmente y definir una teoría general de forcing iterado usando medidas finitamente aditivas. Además, se va a exponer una nueva constelación del digrama de Cichoń donde se separa el lado izquierdo, y el número de cubrimiento del ideal de los subconjuntos nulos de los números reales es singular.
Cross-Alps Logic Seminar (speaker: Márton Elekes)
All the best,
Vincenzo
Nankai Logic Colloquium
Hello everyone,
This week our weekly Nankai Logic Colloquium is going to be in the afternoon.
_____________________________________________________________________
Best wishes,
Ming Xiao
This Week in Logic at CUNY
Date: Monday, April 17, 4.15-6.15pm (NY time), GC 9206
NOTE: Meetings this semester are in person only (no zoom)
For meeting information, please sign up for our mailing list at https://logic.commons.gc.cuny.edu/about/
Title: Probability and logic/meaning: Two approaches
Abstract: In this talk, I will compare and contrast two approaches to the relation between probability and logic/meaning. First, I will examine the Traditional (“Kolmogorovian”) Approach of setting up probability calculi, which presupposes semantic/logical notions and defines conditional probability in terms of unconditional probability. Then, I will discuss the Popperian Approach, which does not presuppose semantic/logical notions, and which takes conditional probability as primitive. Along the way, I will also discuss the prospects (and pitfalls) of adding an Adams-style conditional to various probability calculi.
- - - - Tuesday, Apr 18, 2023 - - - -
Tuesday, April 18, 1:00pm
Virtual (email Victoria Gitman vgitman@gmail.com for meeting id)
Katarzyna W. Kowalik, University of Warsaw
The chain-antichain principle and proof size
The chain-antichain principle is a well-known consequence of Ramsey's theorem for pairs and two colours . It says that for every partial order on there exists an infinite chain or antichain with respect to this order. Both of these principles are -conservative over the weak base theory . Such conservation results usually prompt to ask about lengths of proofs. Kołodziejczyk, Wong and Yokoyama proved that has a non-elementary speedup over for proofs of sentences. We show that the behaviour of is the opposite: it can be polynomially simulated by with respect to sentences. Our argument uses a technique of forcing interpretation developed by Avigad. In the first step we syntactically simulate a construction of a generic computable ultrapower of a model of . Then we find a generic cut satisfying inside the ultrapower.
- - - - Wednesday, Apr 19, 2023 - - - -
Department of Computer Science
Department of Mathematics
The Graduate Center of The City University of New York
Speaker: Walter Tholen, York University.
Date and Time: Wednesday April 19, 2023, 7:00 - 8:30 PM. ZOOM TALK.
Title: What does “smallness” mean in categories of topological spaces?
Abstract: Quillen’s notion of small object and the Gabriel-Ulmer notion of finitely presentable or generated object are fundamental in homotopy theory and categorical algebra. Do these notions always lead to rather uninteresting classes of objects in categories of topological spaces, such as the class of finite discrete spaces, or just the empty space , as the examples and remarks in the existing literature may suggest?
In this talk we will demonstrate that the establishment of full characterizations of these notions (and some natural variations thereof) in many familiar categories of spaces, such as those of T_i-spaces (i= 0, 1, 2), can be quite challenging and may lead to unexpected surprises. In fact, we will show that there are significant differences in this regard even amongst the categories defined by the standard separation conditions, with the T1-separation condition standing out. The findings about these specific categories lead us to insights also when considering rather arbitrary full reflective subcategories of Top.
(Based on joint work with J. Adamek, M. Husek, and J. Rosicky.)
- - - - Thursday, Apr 20, 2023 - - - -
- - - - Friday, Apr 21, 2023 - - - -
CUNY Graduate Center
Virtual: Please email Victoria Gitman (vgitman@gmail.com) for meeting id.
The proper forcing axiom for -sized posets and the continuum
We discuss Shelah's memory iteration technique and use it to show that the PFA for posets of size is consistent with large continuum. This is joint work with David Aspero.
CUNY Graduate Center
How bad could it be? The semilattice of definable sets in continuous logic
Continuous first-order logic is a generalization of discrete first-order logic suited for studying structures with natural underlying metrics, such as operator algebras and -trees. While many things from discrete model theory generalize directly to continuous model theory, there are also new subtleties, such as the correct notion of 'definability' for subsets of a structure. Definable sets are conventionally taken to be those that admit relative quantification in an appropriate sense. An easy argument then establishes that the union of definable sets is definable, but in general the intersection of definable sets may fail to be. This raises the question of which semilattices arise as the partial order of definable sets in a continuous theory.
After giving an overview of the basic properties of definable sets in continuous logic, we will give a largely visual proof that any finite semilattice (and therefore any finite lattice) is the partial order of definable sets in some superstable continuous first-order theory. We will then discuss a partial extension of this to certain infinite semilattices.
- - - - Monday, Apr 24, 2023 - - - -
Date: Monday, April 24, 4.15-6.15pm (NY time), GC 9206
NOTE: Meetings this semester are in person only (no zoom)
For meeting information, please sign up for our mailing list at https://logic.commons.gc.cuny.edu/about/
Title: Inferentialism and connexivity
Abstract: In my talk I will investigate the relationships between two claims about conditionals that by and large are discussed separately. One is the claim that a conditional holds when its consequent can be inferred from its antecedent, or when the latter provides a reason for accepting the former. The other is the claim that conditionals intuitively obey some characteristic connexive principles, such as Aristotle’s Thesis and Boethius Thesis. Following a line of thought that goes back to Chrysippus, I will suggest that these two claims may coherently be understood as distinct manifestations of a single basic idea, namely, that a conditional holds when its antecedent is incompatible with the negation of its consequent. The account of conditionals that I will outline is based precisely on this idea.
- - - - Tuesday, Apr 25, 2023 - - - -
Models of Peano Arithmetic (MOPA)
Tuesday, April 25, 1:00pm
Virtual (email Victoria Gitman vgitman@gmail.com for meeting id)
- - - - Wednesday, Apr 26, 2023 - - - -
Department of Computer Science
Department of Mathematics
The Graduate Center of The City University of New York
Speaker: Dusko Pavlovic, University of Hawai‘i at Mānoa.
Date and Time: Wednesday April 26, 2023, 7:00 - 8:30 PM. ZOOM TALK.
Title: Program-closed categories.
Abstract: > Let CC be a symmetric monoidal category with a comonoid on every object. Let CC* be the cartesian subcategory with the same objects and just the comonoid homomorphisms. A *programming language* is a well-ordered object P with a *program closure*: a family of X-natural surjections
CC(XA,B) <<--run_X-- CC*(X,P)
one for every pair A,B. In this talk, I will sketch a proof that program closure is a property: Any two programming languages are isomorphic along run-preserving morphisms. The result counters Kleene's interpretation of the Church-Turing Thesis, which has been formalized categorically as the suggestion that computability is a structure, like a group presentation, and not a property, like completeness. We prove that it is like completeness. The draft of a book on categorical computability is available from the web site dusko.org.
- - - - Thursday, Apr 27, 2023 - - - -
- - - - Friday, Apr 28, 2023 - - - -
CUNY Graduate Center
Virtual: Please email Victoria Gitman (vgitman@gmail.com) for meeting id.
- - - - Web Site - - - -
Find us on the web at: nylogic.github.io
(site designed, built & maintained by Victoria Gitman)
-------- ADMINISTRIVIA --------
To subscribe/unsubscribe to this list, please email your request to jreitz@citytech.cuny.edu.
If you have a logic-related event that you would like included in future mailings, please email jreitz@citytech.cuny.edu.
Wednesday seminar
(KGRC) two talks on Thursday, April 20
Fwd: Announcement - PhDs in Logic
Dear colleagues,
We would like to announce the XIV edition of the conference PhDs in Logic 2023 that will take place in Granada, Spain, 4-6 october.
There will be 6 keynote talks primarily aimed at PhD students and early career researchers.
Keynote speakers:
- Tomás Ibarlucía - Université de Paris
- Jordi López Abad - UNED
- Nina Gierasimczuk - Danish Technical University
- Amanda Vidal - IIIA - CSIC
- Julian Murzy - University of Salzburg
- María José Frápolli Sanz - Universidad de Granada
----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------
All participants are encouraged to submit an abstract (1000 words). In case it is accepted, the scientific committee will then decide if the abstract merits a 20 minutes presentation and the poster session, or just the poster session.
----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------
Student members of the Association for Symbolic Logic (ASL) may apply for travel support at ASL. Note that such applications have to be submitted at least 3 months prior to the meeting.
The "Sociedad de Lógica, Metodología y Filosofía de la Ciencia" also offers support for members. https://solofici.org/ayudas-a-jovenes-investigadores-para-la-asistencia-a-congresos-internacionales-2/
----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------
See the webpage of the meeting for further information https://phdsinlogicxiv.com/ and do not hesitate to contact us at phdsinlogic@gmail.com.
Best,Catalina TorresJose SantiagoDaira PintoJuan M Santiago
ICREA Research Professor
Universitat de Barcelona
Departament de Matemàtiques i Informàtica
Gran Via de les Corts Catalanes 585
08007 Barcelona
Catalonia
Phone: +34 93 402 1609
joan.bagaria@icrea.cat
bagaria@ub.edu
Charla de Luis Reyes en el Seminario Colombo Mexicano de Teoría de Conjuntos
Seminario Colombo Mexicano de Teoría de Conjuntos
Abril 13
4:00 p.m. - 5:00 p.m. (hora de Colombia)
Universidad Nacional Autónoma de México
Resumen. Los espacios de Johnson-Lindentrauss fueron introducidos por ambos autores en los años setentas como un contraejemplo 'artificial' a propiedades topológicas en análisis funcional. Sin embargo, el estudio de estos espacios ha llevado a entenderlos a través de familias casi ajenas (AD) y las compactaciones de su psi-espacio.
En esta charla, daremos un breve repaso de algunos resultados en esta línea de investigación, así como una introducción a los métodos que permiten traducir propiedades combinatorias de las familias AD a importantes propiedades topológicas de los espacios de Banach.
Logic Seminar 12 April 2023 17:00 hrs at NUS by Daniel Hoffmann via Zoom
This Week in Logic at CUNY
Rutgers Logic Seminar - TODAY'S SEMINAR CANCELLED
- - - - Tuesday, Apr 11, 2023 - - - -
*** April 5-13, 2023 Spring Recess CUNY Graduate Center ***
- - - - Wednesday, Apr 12, 2023 - - - -
*** April 5-13, 2023 Spring Recess CUNY Graduate Center ***
- - - - Thursday, Apr 13, 2023 - - - -
- - - - Friday, Apr 14, 2023 - - - -
CUNY Graduate Center
Virtual: Please email Victoria Gitman (vgitman@gmail.com) for meeting id.
- - - - Monday, Apr 17, 2023 - - - -
Date: Monday, April 17, 4.15-6.15pm (NY time), GC 9206
NOTE: Meetings this semester are in person only (no zoom)
For meeting information, please sign up for our mailing list at https://logic.commons.gc.cuny.edu/about/
Title: Probability and logic/meaning: Two approaches
Abstract: In this talk, I will compare and contrast two approaches to the relation between probability and logic/meaning. First, I will examine the Traditional (“Kolmogorovian”) Approach of setting up probability calculi, which presupposes semantic/logical notions and defines conditional probability in terms of unconditional probability. Then, I will discuss the Popperian Approach, which does not presuppose semantic/logical notions, and which takes conditional probability as primitive. Along the way, I will also discuss the prospects (and pitfalls) of adding an Adams-style conditional to various probability calculi.
- - - - Tuesday, Apr 18, 2023 - - - -
Tuesday, April 18, 1:00pm
Virtual (email Victoria Gitman vgitman@gmail.com for meeting id)
- - - - Wednesday, Apr 19, 2023 - - - -
Department of Computer Science
Department of Mathematics
The Graduate Center of The City University of New York
Speaker: Walter Tholen, York University.
Date and Time: Wednesday April 19, 2023, 7:00 - 8:30 PM. ZOOM TALK.
Title: What does “smallness” mean in categories of topological spaces?
Abstract: Quillen’s notion of small object and the Gabriel-Ulmer notion of finitely presentable or generated object are fundamental in homotopy theory and categorical algebra. Do these notions always lead to rather uninteresting classes of objects in categories of topological spaces, such as the class of finite discrete spaces, or just the empty space , as the examples and remarks in the existing literature may suggest?
In this talk we will demonstrate that the establishment of full characterizations of these notions (and some natural variations thereof) in many familiar categories of spaces, such as those of T_i-spaces (i= 0, 1, 2), can be quite challenging and may lead to unexpected surprises. In fact, we will show that there are significant differences in this regard even amongst the categories defined by the standard separation conditions, with the T1-separation condition standing out. The findings about these specific categories lead us to insights also when considering rather arbitrary full reflective subcategories of Top.
(Based on joint work with J. Adamek, M. Husek, and J. Rosicky.)
- - - - Thursday, Apr 20, 2023 - - - -
- - - - Friday, Apr 21, 2023 - - - -
CUNY Graduate Center
Virtual: Please email Victoria Gitman (vgitman@gmail.com) for meeting id.
CUNY Graduate Center
- - - - Web Site - - - -
Find us on the web at: nylogic.github.io
(site designed, built & maintained by Victoria Gitman)
-------- ADMINISTRIVIA --------
To subscribe/unsubscribe to this list, please email your request to jreitz@citytech.cuny.edu.
If you have a logic-related event that you would like included in future mailings, please email jreitz@citytech.cuny.edu.
Nankai Logic Colloquium
Hello everyone,
This week our weekly Nankai Logic Colloquium is going to be in the morning.
_____________________________________________________________________
Best wishes,
Ming Xiao
Logic Seminar 12 April 2023 17:00 hrs at NUS by Daniel Hoffmann via Zoom
Wednesday seminar
Nankai Logic Colloquium
Hello everyone,
This week our weekly Nankai Logic Colloquium is going to be in the afternoon.
Our speaker this week will be David Schritesser from Harbin Institute of Technology. This talk is going to take place this Friday, Apr 07 , from 4pm to 5pm(UTC+8, Beijing time).
___________________________________________________________________________________________________________________________________________________
This is going to be an online event. Follow the link below to join the Zoom meeting. Please use your real name to join the meeting.
Title : The 23rd Nankai Logic Colloquium --David Schrittesser
Time : 16:00pm, Apr. 07, 2023 (Beijing Time)
Zoom Number : 867 3454 6492
Passcode : 766848
Best wishes,
Ming Xiao
This Week in Logic at CUNY
Logic and Metaphysics Workshop
Date: Monday, April 3, 4.15-6.15pm (NY time), GC 9206
NOTE: Meetings this semester are in person only (no zoom)
For meeting information, please sign up for our mailing list at https://logic.commons.gc.cuny.edu/about/
Thomas Ferguson (Czech Academy of Sciences).
Title: Care-theoretic semantics: Problems and non-deterministic solutions
Abstract: In this talk I will present the details of a project of care-theoretic semantics in which a linguistic feature of care–rather than truth–is understood as the fundamental semantic property. I will review the details, including how adopting a bounds consequence position in which bounds are determined by considerations of topic allows one to determine both a theory of inference and theory of meaning on the basis of care alone. I will consider two challenges to the project: that of the reconciliation of topic-theoretic and truth-theoretic bounds (in which we need to acknowledge cases in which a position crosses both types of bounds) and sui generis monstrous content (in which two anodyne sentences together yield a content-theoretic violation). I will show that in both cases intuitions suggest the use of Nmatrices in the style of Avron and consider the merits of their employment in the care-theoretic setting.
- - - - Tuesday, Apr 4, 2023 - - - -
- - - - Wednesday, Apr 5, 2023 - - - -
*** April 5-13, 2023 Spring Recess CUNY Graduate Center ***
- - - - Thursday, Apr 6, 2023 - - - -
- - - - Friday, Apr 7, 2023 - - - -
CUNY Graduate Center
Virtual: Please email Victoria Gitman (vgitman@gmail.com) for meeting id.
Some old and new results on nonamalgamable forcing extensions
Fixing some countable transitive model of set theory, we can consider its generic multiverse, the family of all models obtainable from by taking any sequence of forcing extensions and ground models. There is an attractive similarity between the generic multiverse and the Turing degrees, but the multiverse has the drawback (or feature?) that it contains nonamalgamable models, that is, models with no common upper bound, as was observed by several people, going back to at least Mostowski. In joint work with Hamkins, Klausner, Verner, and Williams in 2019, we studied the order-theoretic properties of the generic multiverse and, among other results, gave a characterization of which partial orders embed nicely into the multiverse. I will present our results in the simplest case of Cohen forcing, as well as existing generalizations to wide forcing, and some new results on non-Cohen ccc forcings.
- - - - Monday, Apr 10, 2023 - - - -
Rutgers Logic Seminar
Monday, April 10, 2pm, Rutgers University, Hill 005
Jensen's forcing at an inaccessible
- - - - Tuesday, Apr 11, 2023 - - - -
- - - - Wednesday, Apr 12, 2023 - - - -
- - - - Thursday, Apr 13, 2023 - - - -
- - - - Friday, Apr 14, 2023 - - - -
- - - - Web Site - - - -
Find us on the web at: nylogic.github.io
(site designed, built & maintained by Victoria Gitman)
-------- ADMINISTRIVIA --------
To subscribe/unsubscribe to this list, please email your request to Jonas.Reitz12@citytech.cuny.edu.
If you have a logic-related event that you would like included in future mailings, please email Jonas.Reitz12@citytech.cuny.edu.
Wednesday seminar
Logic Seminar 5 April 2023 17:00 hrs at NUS by Frank Stephan
Core Model Seminar next Tuesday
Core Model Seminar: 1:30 - 3 PM Eastern, Online, Martin Zeman, University of California, Irvine
Join Zoom Meeting: https://cmu.zoom.us/j/97749733438?pwd=Yk5PcSsvekptWWxMNUhCU2pFbzA0Zz09
Meeting ID: 977 4973 3438
Passcode: 457791
TITLE: Distributivity of iterated club shooting and fine structural
models, part 1
There are two possible situations where one iteratively adds clubs.
First, for a fixed cardinal $\kappa$, one iteratively adds club subsets
of $\kappa^+$. This kind of construction proved to have many applications. Second, one may start with a cardinal $\delta$ and
iteratively add club subsets of cardinals $\kappa^+$ where $\kappa$
ranges over some set above $\delta$. Surprisingly, this kind of construction has not been much studied. In this talk we will focus on this situation.
In order to add a club subset of some stationary set $S$ the set $S$
must be large in a certain sense; such sets are called fat. It is known
that, consistently, iteratively adding club subsets of fat stationary sets
of $\omega_n$ on a tail-end of $n\in\omega$ followed by forming an
inverse limit at the end may collapse $\aleph_n$ to $\omega$. A strong form of fatness is the property of being the complement of a
non-reflecting stationary set. One can prove, using a fairly standard
argument, that if the iteration described above uses complements of
non-reflecting stationary sets instead of just fat sets, then such an
iteration is $(\omega_{n+1},\infty)$-distributive where $\omega_n$ is
the first active step in the iteration. One can also prove in ZFC that
the analogous amount of distributivity holds of longer iterations,
where the first active step is at $\delta$ and inverse limits are used
at singular steps, as long as the singular steps are of cofinality
$<\delta$. Passing through singular steps of cofinality $\ge\delta$
seems to be difficult, and we only know how to do this over a fine
structural model where the non-reflecting stationary sets are carefully
chosen. Even in such a seemingly special case, the method does have applications.
This is a part of a joint work of Foreman-Magidor-Zeman on games with filters.
Charla de Daniel Calderón en el Seminario Colombo Mexicano de Teoría de Conjuntos
Seminario Colombo Mexicano de Teoría de Conjuntos
Marzo 30
4:00 p.m. - 5:00 p.m. (hora de Colombia)
Universidad de Toronto
Resumen. Los conjuntos fuertemente nulos fueron introducidos por Borel y han sido estudiados desde comienzos del siglo pasado. Borel conjeturó que todo conjunto fuertemente nulo de reales debe ser contable. Algunos años más tarde, Sierpiński demostró que asumiendo CH existe un conjunto fuertemente nulo no contable. Sin embargo, la pregunta por la consistencia relativa a ZFC de la conjetura de Borel siguió irresoluta hasta que en 1976 Laver construyó, en un trabajo innovador, un modelo de ZFC en el que todo conjunto fuertemente nulo de reales es contable.
Nankai Logic Colloquium
Hello everyone,
This week our weekly Nankai Logic Colloquium is going to be in the afternoon.
Our speaker this week will be Samuel Coskey from Boise State University. This talk is going to take place this Friday, Mar 31, from 16:00 to 17:00(UTC+8, Beijing time).
___________________________________________________________________________________________________________________________________________________
This is going to be an online event. Follow the link below to join the Zoom meeting. Please use your real name to join the meeting.
Title : The 22nd Nankai Logic Colloquium --Samuel Coskey
Time : 16:00pm, Mar. 31, 2023 (Beijing Time)
Zoom Number : 830 5925 5547
Passcode : 890764
Link : https://us02web.zoom.us/j/83059255547?pwd=V29IcGo0bWdyeitRdHc5eUhBSnNrQT09
_____________________________________________________________________
Best wishes,
Ming Xiao
Cross-Alps Logic Seminar (speaker: Ludovic Patey)
All the best,
Vincenzo
Logic Seminar Wednesday 29 March 2023 17:00 hrs at NUS by Xie Ruofei
This Week in Logic at CUNY
- - - - Monday, Mar 27, 2023 - - - -
Date: Monday, March 27, 4.15-6.15pm (NY time), GC 9206
NOTE: Meetings this semester are in person only (no zoom)
For meeting information, please sign up for our mailing list at https://logic.commons.gc.cuny.edu/about/
Gregory Taylor (CUNY)
Title: First-order logics over fixed domain
Abstract: What we call first-order logic over fixed domain was initiated, in a certain guise, by Peirce around 1885 and championed, albeit in idiosyncratic form, by Zermelo in papers from the 1930s. We characterize such logics model- and proof-theoretically and argue that they constitute exploration of a clearly circumscribed conception of domain-dependent generality. Whereas a logic, or family of such, can be of interest for any of a variety of reasons, we suggest that one of those reasons might be that said logic fosters some clarification regarding just what qualifies as a logical concept, a logical operation, or a logical law.
- - - - Tuesday, Mar 28, 2023 - - - -
- - - - Wednesday, Mar 29, 2023 - - - -
Department of Computer Science
Department of Mathematics
The Graduate Center of The City University of New York
Speaker: Jim Otto.
Date and Time: Wednesday March 29, 2023, 7:00 - 8:30 PM. ZOOM TALK
Title: P Time, A Bounded Numeric Arrow Category, and Entailments.
Abstract: We revisit the characterization of the P Time functions from our McGill thesis.
1. We build on work of L. Roman (89) on primitive recursion and of A. Cobham (65) and Bellantoni-Cook(92) on P Time.
2. We use base 2 numbers with the digits 1 & 2. Let N be the set of these numbers. We split the tapes of a multi-tape Turing machine each into 2 stacks of digits 1 & 2. These are (modulo allowing an odd numberof stacks) the multi-stack machines we use to study P Time.
3. Let Num be the category with objects the finite products of N and arrows the functions between these. From its arrow category Num^2 we abstract the doctrine (here a category of small categories with chosen structure) PTime of categories with with finite products, base 2 numbers, 2-comprehensions, flat recursion, & safe recursion. Since PTime is a locally finitely presentable category, it has an initial category I. Our characterization is that the bottom of the image of I in Num^2 consists of the P Time functions.
4. We can use I (thinking of its arrows as programs) to run multi-stack machines long enough to get P Time.This is the completeness of the characterization.
5. We cut down the numeric arrow category Num^2, using Bellantoni-Cook growth & time bounds on the functions, to get a bounded numeric arrow category B. B is in the doctrine PTime. This yields the soundness of the characterization.
6. For example, the doctrine of toposes with base 1 numbers, choice, & precisely 2 truth values (which captures much of ZC set theory) likely lacks an initial category, much as there is an initial ring, but no initial field.
7. On the other hand, the L. Roman doctrine PR of categories with finite products, base 1 numbers, & recursion (that is, product stable natural numbers objects) does have an initial category as it consists of the strong models of a finite set of entailments. And is thus locally finitely presentable. We sketch the signature graph for these entailments. And some of these entailments. Similarly (but with more complexity) there are entaiments for the doctrine PTime.
- - - - Thursday, Mar 30, 2023 - - - -
- - - - Friday, Mar 31, 2023 - - - -
CUNY Graduate Center
Virtual: Please email Victoria Gitman (vgitman@gmail.com) for meeting id.
Benjamin Goodman, CUNY
-correct forcing axioms
The standard method of producing a model of a forcing axiom from a supercompact cardinal in fact gives a model of an even stronger principle: that for every small name a and every formula such that is forceable by and preserved under further forcing in our forcing class, there is a filter which meets a desired collection of dense sets and also interprets a such that already holds. I will show how to generalize this result to formulas of higher complexity by starting with slightly stronger large cardinal assumptions, then discuss the bounded versions of these enhanced forcing axioms, their relationships to other similar principles, and their consequences.
CUNY Graduate Center
Corey Switzer, University of Vienna
Galois-Tukey reductions and canonical structure in the Cichoń diagram
Cardinal invariants of the continuum are cardinal numbers which, roughly, measure how 'badly' CH fails in various mathematical contexts such as analysis and topology. For instance the cardinal is the least for which there are many Lebesgue measure zero sets of reals whose union is not measure zero. Classical facts imply but the precise value is undetermined in ZFC and depends heavily on the axioms of set theory. Other numbers follow a similar pattern of 'the least size of a set of reals (Borel sets, etc) lacking a classical smallness property'.
The Cichoń diagram displays cardinal invariants related to Lebesgue measure (the null ideal), Baire category (the meager ideal) as well as the bounding and dominating numbers which concern growth rates of functions. Many surprising ZFC-inequalities exist between these cardinals suggesting a rich world living on the reals in various models of set theory. At the combinatorial heart of every proof of a ZFC inequality derives from a Galois-Tukey reduction: the (ZFC-provable) existence of a pair of continuous maps with simple properties that make sense outside of the context of logic and indeed would be sensible to any analyst or topologist.
In this talk we will discuss some recent work in progress on the descriptive complexity of maps witnessing consistent but non-provable implications. We will show using largely computability theoretic methods that in Gödel's constructible universe there are low level projective reductions between any two cardinal invariants - thus CH holds in a very 'definable' way, while in Solovay's model of 'all sets of reals are Lebesgue measurable' (and therefore the axiom of choice fails) there are no non-ZFC provable implications thus these cardinals are all as different as possible.
- - - - Monday, Apr 3, 2023 - - - -
Logic and Metaphysics Workshop
Date: Monday, April 3, 4.15-6.15pm (NY time), GC 9206
NOTE: Meetings this semester are in person only (no zoom)
For meeting information, please sign up for our mailing list at https://logic.commons.gc.cuny.edu/about/
Thomas Ferguson (Czech Academy of Sciences).
Title: Care-theoretic semantics: Problems and non-deterministic solutions
Abstract: In this talk I will present the details of a project of care-theoretic semantics in which a linguistic feature of care–rather than truth–is understood as the fundamental semantic property. I will review the details, including how adopting a bounds consequence position in which bounds are determined by considerations of topic allows one to determine both a theory of inference and theory of meaning on the basis of care alone. I will consider two challenges to the project: that of the reconciliation of topic-theoretic and truth-theoretic bounds (in which we need to acknowledge cases in which a position crosses both types of bounds) and sui generis monstrous content (in which two anodyne sentences together yield a content-theoretic violation). I will show that in both cases intuitions suggest the use of Nmatrices in the style of Avron and consider the merits of their employment in the care-theoretic setting.
- - - - Tuesday, Apr 4, 2023 - - - -
- - - - Wednesday, Apr 5, 2023 - - - -
*** April 5-13, 2023 Spring Recess CUNY Graduate Center ***
- - - - Thursday, Apr 6, 2023 - - - -
- - - - Friday, Apr 7, 2023 - - - -
CUNY Graduate Center
Virtual: Please email Victoria Gitman (vgitman@gmail.com) for meeting id.
- - - - Web Site - - - -
Find us on the web at: nylogic.github.io
(site designed, built & maintained by Victoria Gitman)
-------- ADMINISTRIVIA --------
To subscribe/unsubscribe to this list, please email your request to Jonas.Reitz12@citytech.cuny.edu.
If you have a logic-related event that you would like included in future mailings, please email Jonas.Reitz12@citytech.cuny.edu.
Wednesday seminar
(KGRC) guests, video recordings and notes, and four talks
Charla de Slawomir Solecki en el Seminario Colombo Mexicano de Teoría de Conjuntos
Seminario Colombo Mexicano de Teoría de Conjuntos
March 23
4:00 p.m. - 5:00 p.m. (Colombia time)
Cornell University
Abstract. The talk is about applications of Descriptive Set Theory to Ergodic Theory.
The behavior of a measure preserving transformation, even a generic one, is highly non-uniform. In contrast to this observation, a different picture of a very uniform behavior of the closed group generated by a generic measure preserving transformation $T$ has emerged. This picture included substantial evidence that pointed to these groups (for a generic $T$) being all topologically isomorphic to a single group, namely, $L^0$---the topological group of all Lebesgue measurable functions from $[0,1]$ to the circle. In fact, Glasner and Weiss asked if this is the case.
We will describe the background touched on above, including the descriptive set theoretic background. We will indicate a proof of the following theorem that answers the Glasner--Weiss question in the negative: for a generic measure preserving transformation $T$, the closed group generated by $T$ is not topologically isomorphic to $L^0$.
Nankai Logic Colloquium
Hello everyone,
This week our weekly Nankai Logic Colloquium is going to be in the morning.
Our speaker this week will be Christian Rosendal from the University of Maryland. This talk is going to take place this Friday, Mar.24 , from 9am to 10am(UTC+8, Beijing time).
If $d$ is a compatible left-invariant metric on $G$, $E\subseteq G$ is a finite subset and $\epsilon>0$, there is a finitely supported probability measure $\beta$ on $G$ so that
$$
\max_{g,h\in E}\, {\sf W}(\beta g, \beta h)<\eps,
$$
where ${\sf W}$ denotes the {\em Wasserstein} or {\em optimal transport} distance between probability measures on the metric space $(G,d)$. When $d$ is the word metric on a finitely generated group $G$, this strengthens a well known theorem of H. Rei\-ter \cite{reiter}. Furthermore, when $G$ is locally compact, $\beta$ may be replaced by an appropriate probability density $f\in L^1(G)$.
Also, when $G\curvearrowright X$ is a continuous isometric action on a metric space, the space of Lipschitz functions on the quotient $X/\!\!/G$ is isometrically isomorphic to a $1$-complemented subspace of the Lipschitz functions on $X$. And finally every continuous affine isometric action of $G$ on a Banach space has a canonical invariant linear subspace.
These results generalise previous theorems due to Schneider--Thom and C\'uth--Doucha.
___________________________________________________________________________________________________________________________________________________
This is going to be an online event. Follow the link below to join the Zoom meeting. Please use your real name to join the meeting.
Title : The 21st Nankai Logic Colloquium --Christian Rosendal
Time : 9:00am, Mar. 24, 2023 (Beijing Time)
Zoom Number : 849 1206 9207
Passcode : 929100
Link : https://zoom.us/j/84912069207?pwd=TTBWakY4OE9sdVNuN2dza3IvemY3Zz09 Christia
_____________________________________________________________________
Best wishes,
Ming Xiao
Logic Seminar Wed 22 March 2023 17:00 hrs at NUS by Takayuki Kihara
This Week in Logic at CUNY
Absolute Undefinability
Date: Monday, March 20th, 4.15-6.15 (NY time), GC Room 9205
NOTE: Meetings this semester are in person only (no zoom)
For meeting information, please sign up for our mailing list at https://logic.commons.gc.cuny.edu/about/
Speaker: Shawn Simpson (Pitt)
Title: Logic and inference in the sender-receiver model
Abstract: The sender-receiver model was developed by David Lewis to tackle the question of the conventionality of meaning. But many people who cared about the conventionality of meaning did so because they thought it was intimately connected to the conventionality of logic. Since Lewis’s work, only a few attempts have been made to say anything about the nature of logic and inference from the perspective of the sender-receiver model. This talk will look at the what’s been said in that regard, by Skyrms and others, and suggest a few general lessons.
- - - - Tuesday, Mar 21, 2023 - - - -
Tuesday, March 21, 1:00pm
Virtual (email Victoria Gitman vgitman@gmail.com for meeting id)
Bartosz Wcisło, University of Gdańsk
Satisfaction classes with the full collection scheme
Satisfaction classes are subsets of models of Peano arithmetic which satisfy Tarski's compositional clauses. Alternatively, we can view satisfaction or truth classes as the extension of a fresh predicate T(x) (the theory in which compositional clauses are viewed as axioms is called CT^-).
It is easy to see that CT^- extended with a full induction scheme is not conservative over PA, since it can prove, for instance, the uniform reflection over arithmetic. By a nontrivial argument of Kotlarski, Krajewski, and Lachlan, the sole compositional axioms of CT^- in fact form a conservative extension of PA. Moreover, in order to obtain non-conservativity it is enough to add induction axioms for the Delta_0 formulae containing the truth predicate.
Answering a question of Kaye, we will show that the theory of compositional truth, CT^- with the full collection scheme is a conservative extension of Peano Arithmetic. Following the initial suggestion of Kaye, we will in fact show that any countable recursively saturated model M of PA has an elementary omega_1-like end extension M' such that M' carries a full satisfaction class.
- - - - Wednesday, Mar 22, 2023 - - - -
- - - - Thursday, Mar 23, 2023 - - - -
- - - - Friday, Mar 24, 2023 - - - -
Logic Workshop
CUNY Graduate Center
Parameter-free comprehension in second-order arithmetic
Second-order arithmetic has two types of objects: numbers and sets of numbers, which we think of as the reals. The second-order arithmetic framework has been used successfully to investigate what kinds of real numbers need to exist to prove various significant results in analysis. One of the strongest second-order arithmetic axiomatizations is the theory consisting of the axioms (for numbers), the set induction axiom, and comprehension for all second-order formulas with set parameters. How significant is the inclusion of set parameters in the comprehension scheme? Let be like , but where set parameters are not allowed in the comprehension scheme. Harvey Friedman showed that and are equiconsistent because parameter-free comprehension suffices to build a model's version of the constructible universe inside the model and the 'constructible' reals satisfy . Kanovei recently showed that models of can be very badly behaved, for example, their sets may not even be closed under complement. Kanovei also showed that there can be nicely behaved models of in which -comprehension (with set parameters) holds. He constructed his model in a forcing extension by a tree iteration of Sacks forcing. In Kanovei's model, -comprehension (with set parameters) fails and he asked whether this can be improved to -comprehension. In this talk, I will show how to construct a model of -comprehension and in which -comprehension fails. The model will be constructed in a forcing extension by a tree iteration of Jensen's forcing. Jensen's forcing is a sub-poset of Sacks forcing constructed by Jensen to show that it is consistent to have a non-constructible -definable singleton real (every -definable set of reals is constructible by Shoenfield's Absoluteness).
- - - - Monday, Mar 27, 2023 - - - -
Date: Monday, March 27, 4.15-6.15pm (NY time), GC 9206
NOTE: Meetings this semester are in person only (no zoom)
For meeting information, please sign up for our mailing list at https://logic.commons.gc.cuny.edu/about/
Gregory Taylor (CUNY)
Title: First-order logics over fixed domain
Abstract: What we call first-order logic over fixed domain was initiated, in a certain guise, by Peirce around 1885 and championed, albeit in idiosyncratic form, by Zermelo in papers from the 1930s. We characterize such logics model- and proof-theoretically and argue that they constitute exploration of a clearly circumscribed conception of domain-dependent generality. Whereas a logic, or family of such, can be of interest for any of a variety of reasons, we suggest that one of those reasons might be that said logic fosters some clarification regarding just what qualifies as a logical concept, a logical operation, or a logical law.
- - - - Tuesday, Mar 28, 2023 - - - -
- - - - Wednesday, Mar 29, 2023 - - - -
Department of Computer Science
Department of Mathematics
The Graduate Center of The City University of New York
Speaker: Jim Otto.
Date and Time: Wednesday March 29, 2023, 7:00 - 8:30 PM. ZOOM TALK
Title: P Time, A Bounded Numeric Arrow Category, and Entailments.
Abstract: We revisit the characterization of the P Time functions from our McGill thesis.
1. We build on work of L. Roman (89) on primitive recursion and of A. Cobham (65) and Bellantoni-Cook(92) on P Time.
2. We use base 2 numbers with the digits 1 & 2. Let N be the set of these numbers. We split the tapes of a multi-tape Turing machine each into 2 stacks of digits 1 & 2. These are (modulo allowing an odd numberof stacks) the multi-stack machines we use to study P Time.
3. Let Num be the category with objects the finite products of N and arrows the functions between these. From its arrow category Num^2 we abstract the doctrine (here a category of small categories with chosen structure) PTime of categories with with finite products, base 2 numbers, 2-comprehensions, flat recursion, & safe recursion. Since PTime is a locally finitely presentable category, it has an initial category I. Our characterization is that the bottom of the image of I in Num^2 consists of the P Time functions.
4. We can use I (thinking of its arrows as programs) to run multi-stack machines long enough to get P Time.This is the completeness of the characterization.
5. We cut down the numeric arrow category Num^2, using Bellantoni-Cook growth & time bounds on the functions, to get a bounded numeric arrow category B. B is in the doctrine PTime. This yields the soundness of the characterization.
6. For example, the doctrine of toposes with base 1 numbers, choice, & precisely 2 truth values (which captures much of ZC set theory) likely lacks an initial category, much as there is an initial ring, but no initial field.
7. On the other hand, the L. Roman doctrine PR of categories with finite products, base 1 numbers, & recursion (that is, product stable natural numbers objects) does have an initial category as it consists of the strong models of a finite set of entailments. And is thus locally finitely presentable. We sketch the signature graph for these entailments. And some of these entailments. Similarly (but with more complexity) there are entaiments for the doctrine PTime.
- - - - Thursday, Mar 30, 2023 - - - -
- - - - Friday, Mar 31, 2023 - - - -
CUNY Graduate Center
Virtual: Please email Victoria Gitman (vgitman@gmail.com) for meeting id.
Benjamin Goodman, CUNY
-correct forcing axioms
The standard method of producing a model of a forcing axiom from a supercompact cardinal in fact gives a model of an even stronger principle: that for every small name a and every formula such that is forceable by and preserved under further forcing in our forcing class, there is a filter which meets a desired collection of dense sets and also interprets a such that already holds. I will show how to generalize this result to formulas of higher complexity by starting with slightly stronger large cardinal assumptions, then discuss the bounded versions of these enhanced forcing axioms, their relationships to other similar principles, and their consequences.
CUNY Graduate Center
- - - - Web Site - - - -
Find us on the web at: nylogic.github.io
(site designed, built & maintained by Victoria Gitman)
-------- ADMINISTRIVIA --------
To subscribe/unsubscribe to this list, please email your request to jreitz@nylogic.org.
If you have a logic-related event that you would like included in future mailings, please email jreitz@nylogic.org. v
Wednesday seminar
(KGRC) Set Theory Seminar talk and Geometry and Analysis on Groups Seminar talk
Logic Seminar today in person in S17#05-11
Nankai Logic Colloquium
Hello everyone,
This week our weekly Nankai Logic Colloquium is going to be in the morning.
___________________________________________________________________________________________________________________________________________________
This is going to be an online event. Follow the link below to join the Zoom meeting. Please use your real name to join the meeting.
Title: The 20th Nankai Logic Colloquium --Konstantin Slutsky
Time: 9:00am, Mar. 17, 2023 (Beijing Time)
Zoom Number:811 5076 2263
Passcode: 201148
Link: https://zoom.us/j/81150762263?pwd=UmdvRkVEUjI2MHlONHQrdmQrRFJyZz09
_____________________________________________________________________
Best wishes,
Ming Xiao
Charla de Cesar Corral en el Seminario Colombo Mexicano de Teoría de Conjuntos
Seminario Colombo Mexicano de Teoría de Conjuntos
Marzo 16
4:00 p.m. - 5:00 p.m. (Hora de Colombia)
Universidad de York
Abstract. Diremos que una familia MAD es pseudocompacta, si el hiperespacio de su -espacio lo es. Algunos resultados de Ginsgurg establecen relaciones entre propiedades del tipo compacidad de un espacio y su hiperespacio, además de que también preguntó la relación entre la pseudocompacidad de y la de su hiperespacio .
Este es un trabajo conjunto con Vinicius de Oliveira Rodrigues.
Cross-Alps Logic Seminar (speaker: Victor Selivanov)
All the best,
Vincenzo
CosmoCaixa Barcelona: Joel Hamkins: pensament estratègic en jocs infinits
neal
ICREA Research Professor
Universitat de Barcelona
Departament de Matemàtiques i Informàtica
Gran Via de les Corts Catalanes 585
08007 Barcelona
Catalonia
Phone: +34 93 402 1609
joan.bagaria@icrea.cat
bagaria@ub.edu
ICREA Research Professor
Universitat de Barcelona
Departament de Matemàtiques i Informàtica
Gran Via de les Corts Catalanes 585
08007 Barcelona
Catalonia
Phone: +34 93 402 1609
joan.bagaria@icrea.cat
bagaria@ub.edu
Wednesday seminar
This Week in Logic at CUNY
- - - - Monday, Mar 13, 2023 - - - -
Logic and Metaphysics Workshop
Date: Monday, March 13, 4.15-6.15pm (NY time), GC 9206
NOTE: Meetings this semester are in person only (no zoom)
For meeting information, please sign up for our mailing list at https://logic.commons.gc.cuny.edu/about/
Melvin Fitting (CUNY)
Title: On Kripke’s proof of Kripke completeness
Abstract: Saul Kripke announced his possible world semantics in 1959, and `published his proof of axiomatic completeness for the standard modal logics of the time in 1963. It is very unlike the standard completeness proof used today, which involves a Lindenbaum/Henkin construction and produces canonical models. Kripke’s proof involved tableaus, in a format that is difficult to follow, and uses tableau construction algorithms that are complex and somewhat error prone to describe. I will first discuss Kripke’s proof, then the historical origins of the modern version. Then I will show that completeness, proved Kripke style, could actually have been done in the Lindenbaum/Henkin way, thus simplifying things considerably. None of this is new but, with the parts collected together it is an interesting story. “In my end is my beginning”.
- - - - Tuesday, Mar 14, 2023 - - - -
Models of Peano Arithmetic (MOPA)
Tuesday, March 14, 1:00pm
Virtual (email Victoria Gitman vgitman@gmail.com for meeting id)
Bartosz Wcisło, University of Gdańsk
Satisfaction classes with the full collection scheme
Satisfaction classes are subsets of models of Peano arithmetic which satisfy Tarski's compositional clauses. Alternatively, we can view satisfaction or truth classes as the extension of a fresh predicate T(x) (the theory in which compositional clauses are viewed as axioms is called CT^-).
It is easy to see that CT^- extended with a full induction scheme is not conservative over PA, since it can prove, for instance, the uniform reflection over arithmetic. By a nontrivial argument of Kotlarski, Krajewski, and Lachlan, the sole compositional axioms of CT^- in fact form a conservative extension of PA. Moreover, in order to obtain non-conservativity it is enough to add induction axioms for the Delta_0 formulae containing the truth predicate.
Answering a question of Kaye, we will show that the theory of compositional truth, CT^- with the full collection scheme is a conservative extension of Peano Arithmetic. Following the initial suggestion of Kaye, we will in fact show that any countable recursively saturated model M of PA has an elementary omega_1-like end extension M' such that M' carries a full satisfaction class.
- - - - Wednesday, Mar 15, 2023 - - - -
Department of Computer Science
Department of Mathematics
The Graduate Center of The City University of New York
Date and Time: Wednesday March 15, 2023, 7:00 - 8:30 PM. IN PERSON TALK.
Title: EILC toposes.
Abstract: In topos theory, local connectedness of a geometric morphism is a very geometric property, in the sense that it is stable under base change, can be checked locally, and so on. In some situations however, the weaker property of being essential is easier to verify. In this talk, we will discuss EILC toposes: toposes E such that any essential geometric morphism with codomain E is automatically locally connected. It turns out that many toposes of interest are EILC, including toposes of sheaves on Hausdorff spaces and classifying toposes of compact groups.
- - - - Thursday, Mar 16, 2023 - - - -
- - - - Friday, Mar 17, 2023 - - - -
CUNY Graduate Center
Virtual: Please email Victoria Gitman (vgitman@gmail.com) for meeting id.
Jonathan Osinski, University of Hamburg
Model-Theoretic Characterizations of Weak Vopěnka's Principle
It has been known since the 1980s that Vopěnka's Principle (VP) is equivalent to certain statements about logics, e.g. to the schema 'Every logic has a compactness cardinal.' On the other hand, it was only recently shown by Trevor Wilson that a related statement statement called Weak Vopěnka's Principle (WVP) is strictly weaker than VP. In fact, Joan Bagaria and Wilson showed that WVP is equivalent to the existence of -strong cardinals for all natural numbers . We generalize logical characterizations of strong cardinals to achieve a characterization of -strong cardinals and therefore of WVP in terms of properties of strong logics. This is partly joint work with Will Boney and partly with Trevor Wilson.
CUNY Graduate Center
Filippo Calderoni, Rutgers University
Rotation equivalence and rigidity
The theory of countable Borel equivalence relations analyzes the actions of countable groups on Polish spaces. The main question studied is how much information is encoded by the corresponding orbit space. The amount of encoded information reflects the extent to which the action is rigid.
In this talk we will discuss rigidity results for the action of the group of rational rotations. In particular we will analyze the rotation equivalence on spheres in higher dimension. This is connected to superrigidity results of Margulis and to Zimmer’s program about the actions of discrete subgroups of Lie groups on manifolds.
- - - - Monday, Mar 20, 2023 - - - -
Absolute Undefinability
Date: Monday, March 20, 4.15-6.15pm (NY time), GC 9206
NOTE: Meetings this semester are in person only (no zoom)
For meeting information, please sign up for our mailing list at https://logic.commons.gc.cuny.edu/about/
Gregory Taylor (CUNY)
Title: First-order logics over fixed domain
Abstract: What we call first-order logic over fixed domain was initiated, in a certain guise, by Peirce around 1885 and championed, albeit in idiosyncratic form, by Zermelo in papers from the 1930s. We characterize such logics model- and proof-theoretically and argue that they constitute exploration of a clearly circumscribed conception of domain-dependent generality. Whereas a logic, or family of such, can be of interest for any of a variety of reasons, we suggest that one of those reasons might be that said logic fosters some clarification regarding just what qualifies as a logical concept, a logical operation, or a logical law.
- - - - Tuesday, Mar 21, 2023 - - - -
- - - - Wednesday, Mar 22, 2023 - - - -
- - - - Thursday, Mar 23, 2023 - - - -
- - - - Friday, Mar 24, 2023 - - - -
Logic Workshop
CUNY Graduate Center
- - - - Web Site - - - -
Find us on the web at: nylogic.github.io
(site designed, built & maintained by Victoria Gitman)
-------- ADMINISTRIVIA --------
To subscribe/unsubscribe to this list, please email your request to jreitz@nylogic.org.
If you have a logic-related event that you would like included in future mailings, please email jreitz@nylogic.org.
(KGRC) talks on Tuesday, March 14 and Thursday, March 16
Nankai Logic Colloquium
Hello everyone,
This week our weekly Nankai Logic Colloquium is going to be in the afternoon.
Our speaker this week will be Vladimir Kanovei from the Institute for Information Transmission Problems, RAS. This talk is going to take place this Friday, Mar.10, from 4pm to 5pm(UTC+8, Beijing time).
Title:On the significance of parameters in the choice and сomprehension schemata in the 2nd-order Peano arithmetic Abstract Parameters are free variables in various axiom schemata in PA, ZFC, and other similar theories. Given an axiom schema S, we let S* be the parameter-free sub-schema. Kreisel (A survey of proof theory, JSL 1968) was one of those who paid attention to the comparison of some schemata in second-order PA and their parameter-free versions. In particular, Kreisel noted that [...] if one is convinced of the significance of something like agiven axiom schema, it is natural to study details, such as the effect of parameters. This talk is devoted to the effect of parameters in the schemata of Comprehension and Choice in second-order arithmetic.
_____________________________________________________________________
Best wishes,
Ming Xiao
UPDATE - This Week in Logic at CUNY
Logic and Metaphysics Workshop
Date: Monday, March 6, 4.15-6.15pm (NY time), GC 9206
NOTE: Meetings this semester are in person only (no zoom)
For meeting information, please sign up for our mailing list at https://logic.commons.gc.cuny.edu/about/
Title: Lewis on accommodation and representation de re
Abstract: Recall Lumpl, the lump of clay out of which the statue Goliath is fashioned. While (1) ‘Lumpl could have survived a squashing’ is true, (2) ‘Goliath could have survived a squashing’ is false, it being after all essential to Goliath, but not to Lumpl, that it be a statue. We have here an example of what David Lewis (1986) called “the inconstancy of representation de re”. For Lewis, the inconstancy does not amount to inconsistency, but rather points to the context-sensitivity of de re modal predication: (1) and (2) make implicit, context-sensitive reference to different counterpart relations. Once we recognize this, Lewisians argue, it becomes clear how our intuitive truth-conditional judgments are fully consistent. As I show, however, the conversational rule that triggers the implicit reference not only fails to license the reference shift, it effectively prohibits it. The upshot is that counterpart theory is deprived of a central motivation.
- - - - Tuesday, Mar 7, 2023 - - - -
Models of Peano Arithmetic (MOPA)
Tuesday, March 7, 1:00pm
Virtual (email Victoria Gitman vgitman@gmail.com for meeting id)
Bellaouar Djamel, University 08 Mai 1945 Guelma
Some generalizations on the representation of unlimited natural numbers
Based on permanence principles of nonstandard analysis and as a continuation of the papers [1-3], we present some notes and questions on the representation of unlimited natural numbers. As a natural generalization, let be an unlimited by matrix with integer entries (i.e one of its integer entries is unlimited). Here we prove that every unlimited matrix with integer entries can be written as the sum of a limited matrix S with integer entries and the product of two unlimited matrices and with integer entries, that is, . For further research, we propose several matrix representation forms.
Finally, we consider the numbers of the form where , are integers, which are called Gaussian integers. In the case when or is unlimited, the number is said to be unlimited. Also, some notes on the representation of unlimited Gaussian integers are given.
[1] A. Boudaoud, La conjecture de Dickson et classes particulière d'entiers, Ann. Math. Blaise Pascal. 13 (2006), 103-109.
[2] A. Boudaoud and D. Bellaouar, Representation of integers: A nonclassical point of view, J. Log. Anal. 12:4 (2020) 1-31.
[3] K. Hrbacek, On Factoring of unlimited integers, J. Log. Anal. 12:5 (2020) 1-6.
- - - - Wednesday, Mar 8, 2023 - - - -
- - - - Thursday, Mar 9, 2023 - - - -
- - - - Friday, Mar 10, 2023 - - - -
CUNY Graduate Center
CUNY Graduate Center
Virtual: Please email Victoria Gitman (vgitman@gmail.com) for meeting id.
- - - - Monday, Mar 13, 2023 - - - -
Logic and Metaphysics Workshop
Date: Monday, March 13, 4.15-6.15pm (NY time), GC 9206
NOTE: Meetings this semester are in person only (no zoom)
For meeting information, please sign up for our mailing list at https://logic.commons.gc.cuny.edu/about/
Melvin Fitting (CUNY)
Title: On Kripke’s proof of Kripke completeness
Abstract: Saul Kripke announced his possible world semantics in 1959, and `published his proof of axiomatic completeness for the standard modal logics of the time in 1963. It is very unlike the standard completeness proof used today, which involves a Lindenbaum/Henkin construction and produces canonical models. Kripke’s proof involved tableaus, in a format that is difficult to follow, and uses tableau construction algorithms that are complex and somewhat error prone to describe. I will first discuss Kripke’s proof, then the historical origins of the modern version. Then I will show that completeness, proved Kripke style, could actually have been done in the Lindenbaum/Henkin way, thus simplifying things considerably. None of this is new but, with the parts collected together it is an interesting story. “In my end is my beginning”.
- - - - Tuesday, Mar 14, 2023 - - - -
Models of Peano Arithmetic (MOPA)
Tuesday, March 14, 1:00pm
Virtual (email Victoria Gitman vgitman@gmail.com for meeting id)
- - - - Wednesday, Mar 15, 2023 - - - -
Department of Computer Science
Department of Mathematics
The Graduate Center of The City University of New York
Date and Time: Wednesday March 15, 2023, 7:00 - 8:30 PM. IN PERSON TALK.
Title: EILC toposes.
Abstract: In topos theory, local connectedness of a geometric morphism is a very geometric property, in the sense that it is stable under base change, can be checked locally, and so on. In some situations however, the weaker property of being essential is easier to verify. In this talk, we will discuss EILC toposes: toposes E such that any essential geometric morphism with codomain E is automatically locally connected. It turns out that many toposes of interest are EILC, including toposes of sheaves on Hausdorff spaces and classifying toposes of compact groups.
- - - - Thursday, Mar 16, 2023 - - - -
- - - - Friday, Mar 17, 2023 - - - -
CUNY Graduate Center
Virtual: Please email Victoria Gitman (vgitman@gmail.com) for meeting id.
CUNY Graduate Center
Modality TBA
- - - - Web Site - - - -
Find us on the web at: nylogic.github.io
(site designed, built & maintained by Victoria Gitman)
-------- ADMINISTRIVIA --------
To subscribe/unsubscribe to this list, please email your request to jreitz@nylogic.org.
If you have a logic-related event that you would like included in future mailings, please email jreitz@nylogic.org.
Charla de Paul Szeptycki en el Seminario Colombo Mexicano de Teoría de Conjuntos
Seminario Colombo Mexicano de Teoría de Conjuntos
March 9
4:00 p.m. - 5:00 p.m. (Colombia time)
York University
Abstract. We define a topological space $X$ to be $n$-Ramsey if for every map $f: [\omega]^n \rightarrow X$ there is an infinite set $M$ and a point $x \in X$ such that $f \uphaproonright [M]^n$ converges to $x$ in a natural sense. Sequentially compact spaces are precisely the $1$-Ramsey spaces and any $n+1$-Ramsey space is $n$-Ramsey. We discuss basic results about these new classes of spaces, directions of current work in progress and some open problems.
Zoom is the leader in modern enterprise video communications, with an easy, reliable cloud platform for video and audio conferencing, chat, and webinars across mobile, desktop, and room systems. Zoom Rooms is the original software-based conference room solution
used around the world in board, conference, huddle, and training rooms, as well as executive offices and classrooms. Founded in 2011, Zoom helps businesses and organizations bring their teams together in a frictionless environment to get more done. Zoom is
a publicly traded company headquartered in San Jose, CA.
cuaieed-unam.zoom.us
|
This Week in Logic at CUNY
Logic and Metaphysics Workshop
Date: Monday, March 6, 4.15-6.15pm (NY time), GC 9206
NOTE: Meetings this semester are in person only (no zoom)
For meeting information, please sign up for our mailing list at https://logic.commons.gc.cuny.edu/about/
Title: Lewis on accommodation and representation de re
Abstract: Recall Lumpl, the lump of clay out of which the statue Goliath is fashioned. While (1) ‘Lumpl could have survived a squashing’ is true, (2) ‘Goliath could have survived a squashing’ is false, it being after all essential to Goliath, but not to Lumpl, that it be a statue. We have here an example of what David Lewis (1986) called “the inconstancy of representation de re”. For Lewis, the inconstancy does not amount to inconsistency, but rather points to the context-sensitivity of de re modal predication: (1) and (2) make implicit, context-sensitive reference to different counterpart relations. Once we recognize this, Lewisians argue, it becomes clear how our intuitive truth-conditional judgments are fully consistent. As I show, however, the conversational rule that triggers the implicit reference not only fails to license the reference shift, it effectively prohibits it. The upshot is that counterpart theory is deprived of a central motivation.
- - - - Tuesday, Mar 7, 2023 - - - -
Models of Peano Arithmetic (MOPA)
Tuesday, March 7, 1:00pm
Virtual (email Victoria Gitman vgitman@gmail.com for meeting id)
Bellaouar Djamel, University 08 Mai 1945 Guelma
Some generalizations on the representation of unlimited natural numbers
Based on permanence principles of nonstandard analysis and as a continuation of the papers [1-3], we present some notes and questions on the representation of unlimited natural numbers. As a natural generalization, let be an unlimited by matrix with integer entries (i.e one of its integer entries is unlimited). Here we prove that every unlimited matrix with integer entries can be written as the sum of a limited matrix S with integer entries and the product of two unlimited matrices and with integer entries, that is, . For further research, we propose several matrix representation forms.
Finally, we consider the numbers of the form where , are integers, which are called Gaussian integers. In the case when or is unlimited, the number is said to be unlimited. Also, some notes on the representation of unlimited Gaussian integers are given.
[1] A. Boudaoud, La conjecture de Dickson et classes particulière d'entiers, Ann. Math. Blaise Pascal. 13 (2006), 103-109.
[2] A. Boudaoud and D. Bellaouar, Representation of integers: A nonclassical point of view, J. Log. Anal. 12:4 (2020) 1-31.
[3] K. Hrbacek, On Factoring of unlimited integers, J. Log. Anal. 12:5 (2020) 1-6.
- - - - Wednesday, Mar 8, 2023 - - - -
- - - - Thursday, Mar 9, 2023 - - - -
- - - - Friday, Mar 10, 2023 - - - -
CUNY Graduate Center
Modality TBA
CUNY Graduate Center
Virtual: Please email Victoria Gitman (vgitman@gmail.com) for meeting id.
- - - - Monday, Mar 13, 2023 - - - -
Logic and Metaphysics Workshop
Date: Monday, March 13, 4.15-6.15pm (NY time), GC 9206
NOTE: Meetings this semester are in person only (no zoom)
For meeting information, please sign up for our mailing list at https://logic.commons.gc.cuny.edu/about/
Melvin Fitting (CUNY)
Title: On Kripke’s proof of Kripke completeness
Abstract: Saul Kripke announced his possible world semantics in 1959, and `published his proof of axiomatic completeness for the standard modal logics of the time in 1963. It is very unlike the standard completeness proof used today, which involves a Lindenbaum/Henkin construction and produces canonical models. Kripke’s proof involved tableaus, in a format that is difficult to follow, and uses tableau construction algorithms that are complex and somewhat error prone to describe. I will first discuss Kripke’s proof, then the historical origins of the modern version. Then I will show that completeness, proved Kripke style, could actually have been done in the Lindenbaum/Henkin way, thus simplifying things considerably. None of this is new but, with the parts collected together it is an interesting story. “In my end is my beginning”.
- - - - Tuesday, Mar 14, 2023 - - - -
Models of Peano Arithmetic (MOPA)
Tuesday, March 14, 1:00pm
Virtual (email Victoria Gitman vgitman@gmail.com for meeting id)
- - - - Wednesday, Mar 15, 2023 - - - -
Department of Computer Science
Department of Mathematics
The Graduate Center of The City University of New York
Date and Time: Wednesday March 15, 2023, 7:00 - 8:30 PM. IN PERSON TALK.
Title: EILC toposes.
Abstract: In topos theory, local connectedness of a geometric morphism is a very geometric property, in the sense that it is stable under base change, can be checked locally, and so on. In some situations however, the weaker property of being essential is easier to verify. In this talk, we will discuss EILC toposes: toposes E such that any essential geometric morphism with codomain E is automatically locally connected. It turns out that many toposes of interest are EILC, including toposes of sheaves on Hausdorff spaces and classifying toposes of compact groups.
- - - - Thursday, Mar 16, 2023 - - - -
- - - - Friday, Mar 17, 2023 - - - -
CUNY Graduate Center
Virtual: Please email Victoria Gitman (vgitman@gmail.com) for meeting id.
CUNY Graduate Center
Modality TBA
- - - - Web Site - - - -
Find us on the web at: nylogic.github.io
(site designed, built & maintained by Victoria Gitman)
-------- ADMINISTRIVIA --------
To subscribe/unsubscribe to this list, please email your request to jreitz@nylogic.org.
If you have a logic-related event that you would like included in future mailings, please email jreitz@nylogic.org.
Barcelona Set Theory Seminar
ICREA Research Professor
Universitat de Barcelona
Departament de Matemàtiques i Informàtica
Gran Via de les Corts Catalanes 585
08007 Barcelona
Catalonia
Phone: +34 93 402 1609
joan.bagaria@icrea.cat
bagaria@ub.edu
Wednesday seminar
(KGRC) two talks at U Wien and TU Wien
CosmoCaixa Barcelona: Joel Hamkins: pensament estratègic en jocs infinits
ICREA Research Professor
Universitat de Barcelona
Departament de Matemàtiques i Informàtica
Gran Via de les Corts Catalanes 585
08007 Barcelona
Catalonia
Phone: +34 93 402 1609
joan.bagaria@icrea.cat
bagaria@ub.edu
Logic Seminar 8 March 2023 17:00 hrs at NUS by Chong Chitat
Today's Logic Seminar is via Zoom
Nankai Logic Colloquium
Hello everyone,
This week our weekly Nankai Logic Colloquium is going to be in the afternoon.
Our speaker this week will be Martino Lupini from the University of Bologna. This talk is going to take place this Friday, Mar. 03, from 16:00 to 17:00 (UTC+8, Beijing time).
___________________________________________________________________________________________________________________________________________________
This is going to be an online event. Follow the link below to join the Zoom meeting. Please use your real name to join the meeting.
Title: The 18th Nankai Logic Colloquium --Martino Lupini
Time: 16:00, Mar. 3, 2023 (Beijing Time)
Zoom Number:859 1679 0296
Passcode: 577088
Link: https://zoom.us/j/85916790296?pwd=WGRrZjJKa0kvRE9KSGtxNkJia2JiUT09
_____________________________________________________________________
Best wishes,
Ming Xiao
Cross-Alps Logic Seminar (speaker: Dugald MacPherson)
All the best,
Vincenzo
(KGRC) Logic Colloquium talk on Thursday, March 2
Wednesday seminar
This Week in Logic at CUNY
Ramsey's Theorem in the countable and weak randomness
Date: Monday, February 27, 4.15-6.15pm (NY time), GC 9205
NOTE: Meetings this semester are in person only (no zoom)
For meeting information, please sign up for our mailing list at https://logic.commons.gc.cuny.edu/about/
Abstract: Neopragmatists seek to sidestep metaphysical puzzles by shifting the target of philosophical explanation from the objects we think and talk about to the functions of expressions and concepts in our cognitive economy. Logical vocabulary can serve as a target for neopragmatist inquiry, and it has also posed obstacles to neopragmatist accounts of other vocabulary. I will argue that the obstacles can be addressed by adopting a neopragmatist perspective toward logical relations, such as logical consequence, and toward propositional content. Doing so calls into question two purported constraints on explanations of the functions of logical connectives. I will sketch an account made possible by rejecting those constraints, one according to which logical connectives serve to express dialectical attitudes. The proposal is deflationary in two ways: it rests on an extension of deflationism from truth to logical relations, and it aims to deflate some of neopragmatists’ theoretical ambitions.
- - - - Tuesday, Feb 28, 2023 - - - -
Tuesday, February 28, 1:00pm
Virtual (email Victoria Gitman vgitman@gmail.com for meeting id)
Zuzana Hanikova, Czech Academy of Sciences
Vopěnka's Alternative Set Theory and its mathematical context
Vopěnka first presented his Alternative Set Theory (AST) in the monograph 'Mathematics in the Alternative Set Theory' published by Teubner, Leipzig in 1979. Another book presenting the theory, 'Introduction to Mathematics in the Alternative Set Theory', was published in 1989 in Slovak by Alfa, Bratislava. In addition there are numerous journal papers on the AST by members of the research group established by Vopěnka, and the proceedings of a conference dedicated to the AST, also from 1989. In several essays, Vopěnka sought to lay out the motivation and philosophical import of the AST and some of his subsequent work. As one consequence of the emphasis on his philosophy, the mathematical inspiration for the AST has been somewhat obliterated. The aim of the talk is to discuss the design choices Vopěnka made for the AST in relation to pertinent mathematical developments of the 20th century, such as Skolem's work on nonstandard models of arithmetic, Robinson's nonstandard analysis, Rieger's nonstandard models of arithmetic, Vopěnka's nonstandard model of set theory, Vopěnka and Hájek's theory of semisets, or Parikh's almost consistent theories. The presentation will include an outline of the AST following the works of Vopěnka and Sochor. This is a historical talk; no new mathematical results on the AST will be presented.
- - - - Wednesday, Mar 1, 2023 - - - -
- - - - Thursday, Mar 2, 2023 - - - -
- - - - Friday, Mar 3, 2023 - - - -
- - - - Monday, Mar 6, 2023 - - - -
Logic and Metaphysics Workshop
Date: Monday, March 6, 4.15-6.15pm (NY time), GC 9205
NOTE: Meetings this semester are in person only (no zoom)
For meeting information, please sign up for our mailing list at https://logic.commons.gc.cuny.edu/about/
Title: Lewis on accommodation and representation de re
Abstract: Recall Lumpl, the lump of clay out of which the statue Goliath is fashioned. While (1) ‘Lumpl could have survived a squashing’ is true, (2) ‘Goliath could have survived a squashing’ is false, it being after all essential to Goliath, but not to Lumpl, that it be a statue. We have here an example of what David Lewis (1986) called “the inconstancy of representation de re”. For Lewis, the inconstancy does not amount to inconsistency, but rather points to the context-sensitivity of de re modal predication: (1) and (2) make implicit, context-sensitive reference to different counterpart relations. Once we recognize this, Lewisians argue, it becomes clear how our intuitive truth-conditional judgments are fully consistent. As I show, however, the conversational rule that triggers the implicit reference not only fails to license the reference shift, it effectively prohibits it. The upshot is that counterpart theory is deprived of a central motivation.
- - - - Tuesday, Mar 7, 2023 - - - -
Models of Peano Arithmetic (MOPA)
Tuesday, March 7, 1:00pm
Virtual (email Victoria Gitman vgitman@gmail.com for meeting id)
Bellaouar Djamel, University 08 Mai 1945 Guelma
Some generalizations on the representation of unlimited natural numbers
Based on permanence principles of nonstandard analysis and as a continuation of the papers [1-3], we present some notes and questions on the representation of unlimited natural numbers. As a natural generalization, let be an unlimited by matrix with integer entries (i.e one of its integer entries is unlimited). Here we prove that every unlimited matrix with integer entries can be written as the sum of a limited matrix S with integer entries and the product of two unlimited matrices and with integer entries, that is, . For further research, we propose several matrix representation forms.
Finally, we consider the numbers of the form where , are integers, which are called Gaussian integers. In the case when or is unlimited, the number is said to be unlimited. Also, some notes on the representation of unlimited Gaussian integers are given.
[1] A. Boudaoud, La conjecture de Dickson et classes particulière d'entiers, Ann. Math. Blaise Pascal. 13 (2006), 103-109.
[2] A. Boudaoud and D. Bellaouar, Representation of integers: A nonclassical point of view, J. Log. Anal. 12:4 (2020) 1-31.
[3] K. Hrbacek, On Factoring of unlimited integers, J. Log. Anal. 12:5 (2020) 1-6.
- - - - Wednesday, Mar 8, 2023 - - - -
- - - - Thursday, Mar 9, 2023 - - - -
- - - - Friday, Mar 10, 2023 - - - -
CUNY Graduate Center
Modality TBA
CUNY Graduate Center
Virtual: Please email Victoria Gitman (vgitman@gmail.com) for meeting id.
- - - - Web Site - - - -
Find us on the web at: nylogic.github.io
(site designed, built & maintained by Victoria Gitman)
-------- ADMINISTRIVIA --------
To subscribe/unsubscribe to this list, please email your request to jreitz@nylogic.org.
If you have a logic-related event that you would like included in future mailings, please email jreitz@nylogic.org.
Barcelona Set Theory Seminar
ICREA Research Professor
Universitat de Barcelona
Departament de Matemàtiques i Informàtica
Gran Via de les Corts Catalanes 585
08007 Barcelona
Catalonia
Phone: +34 93 402 1609
joan.bagaria@icrea.cat
bagaria@ub.edu
BLAST in Charlottle NC: May 16-20, 2023
CMU Math Logic Seminar next Tuesday
Mathematical Logic Seminar: 3:30-4:30 PM Eastern, Online, Marcin Sabok, McGill University
Join Zoom Meeting: https://cmu.zoom.us/j/92655324096?pwd=VUhSSlkrdHMxbTlSYUMxYzFXM01kdz09
Meeting ID: 926 5532 4096
Passcode: 555455
TITLE: Perfect matchings in hyperfinite graphings
ABSTRACT: The talk will focus on recent results on measurable perfect matchings in hyperfinite graphings. In particular, we will discuss a result saying that every regular hyperfinite one-ended bipartite graphing admits a measurable perfect matching. We will also see some applications of these results, answering several questions in the field. For instance we will characterize the existence of factor of iid perfect matchings in bipartite Cayley graphs, extending a result of Lyons and Nazarov. We will also answer a question of Bencs, Hruskova and Toth arising in the study of balanced orientations in graphings. Finally, we see how the results imply the measurable circle squaring. This is joint work with Matt Bowen and Gabor Kun.
Logic Seminar 1 March 2023 17:00 hrs Singapore time by Linus Richter at NUS via Zoom
Nankai Logic Colloquium
Hello everyone,
This week our weekly Nankai Logic Colloquium is going to be in the morning.
Our speaker this week will be Slawomir Solecki from Cornell University. This talk is going to take place this Friday, Feb.24, 2023, from 9am to 10am (UTC+8, Beijing time).
Title: Descriptive Set Theory and closed groups generated by generic measure preserving transformationsAbstract: The subject matter of the talk lies within the area that employs the descriptive set theoretic point of view in the study of large topological groups.The behavior of a measure preserving transformation, even a generic one, is highly non-uniform. In contrast to this observation, a different picture of a very uniform behavior of the closed group generated by a generic measure preserving transformation $T$ has emerged. This picture included substantial evidence that pointed to these groups (for a generic $T$) being all topologically isomorphic to a single group, namely, $L^0$---the topological group of all Lebesgue measurable functions from $[0,1]$ to the circle. In fact, Glasner and Weiss asked if this is the case.We will describe the background touched on above, including the descriptive set theoretic background. We will indicate a proof of the following theorem that answers the Glasner--Weiss question in the negative: for a generic measure preserving transformation $T$, the closed group generated by $T$ is {\bf not} topologically isomorphic to $L^0$.
This is going to be an online event. Follow the link below to join the Zoom meeting. Please use your real name to join the meeting.
Title: The 17th Nankai Logic Colloquium --Slawomir Solecki
Time: 9:00am, Feb. 24, 2023 (Beijing Time)
Zoom Number:854 3647 9165
Passcode: 977845
Link: https://zoom.us/j/85436479165?pwd=cjFwZlpUZWtCcnhTci9OK0R5ODU0UT09
_____________________________________________________________________
Best wishes,
Ming Xiao
This Week in Logic at CUNY
- - - - Monday, Feb 13, 2023 - - - -
Forcing more choice over the Chang model
- - - - Tuesday, Feb 14, 2023 - - - -
Tuesday, February 14, 1:00pm
Virtual (email Victoria Gitman vgitman@gmail.com for meeting id)
Vladimir Kanovei, Institute for Information Transmission Problems
On the significance of parameters in the choice and сomprehension schemata in the 2nd-order Peano arithmetic
Parameters are free variables in various axiom schemata in PA, ZFC, and other similar theories. Given an axiom schema S, we let S* be the parameter-free sub-schema.
Kreisel (A survey of proof theory, JSL 1968) was one of those who paid attention to the comparison of some schemata in second-order PA and their parameter-free versions. In particular, Kreisel noted that
[...] if one is convinced of the significance of something like a given axiom schema, it is natural to study details, such as the effect of parameters.This talk is devoted to the effect of parameters in the schemata of Comprehension and Choice in second-order arithmetic.
- - - - Wednesday, Feb 15, 2023 - - - -
Department of Computer Science
Department of Mathematics
The Graduate Center of The City University of New York
Special Topic: TQFT and Computation, Second Lecture.
Speaker: Mee Seong Im, United States Naval Academy, Annapolis.
Date and Time: Wednesday February 15, 2023, 7:00 - 8:30 PM. IN PERSON TALK.
Title: Automata and topological theories.
Abstract: Theory of regular languages and finite state automata is part of the foundations of computer science. Topological quantum field theories (TQFT) are a key structure in modern mathematical physics. We will interpret a nondeterministic automaton as a Boolean-valued one-dimensional TQFT with defects labelled by letters of the alphabet for the automaton. We will also describe how a pair of a regular language and a circular regular language gives rise to a lax one-dimensional TQFT.
- - - - Thursday, Feb 16, 2023 - - - -
- - - - Friday, Feb 17, 2023 - - - -
CUNY Graduate Center
Hybrid: Please email Victoria Gitman (vgitman@gmail.com) for meeting id.
Russell Miller, CUNY
Computability and the Absolute Galois Group of
Fix a computable presentation of the algebraic closure of the rational numbers. The absolute Galois group of the rational numbers, which is precisely the automorphism group of the field , may then be viewed as a collection of paths through a finite-branching tree. Each individual automorphism has a Turing degree. We will use known results in computability to try to build natural countable elementary subgroups of the absolute Galois group. Several intriguing questions in number theory will appear as we measure the extent to which we succeed in doing so.
- - - - Monday, Feb 20, 2023 - - - -
- - - - Tuesday, Feb 21, 2023 - - - -
Models of Peano Arithmetic (MOPA)
Tuesday, February 21, 1:00pm
Virtual (email Victoria Gitman vgitman@gmail.com for meeting id)
Alexei Miasnikov, Stevens Institute of Technology
First-order classification and non-standard models
In this talk I will discuss some recent advances in the first-order classification problem. I will touch on first-order rigidity and quasi finite axiomatization. However, the main point of the presentation is on how, in principle, one can describe all structures which are first-order equivalent to a given one. This leads to non-standard models of algebraic structures (aka non-standard analysis or non-standard arithmetic), which are interesting in their own right.
- - - - Wednesday, Feb 22, 2023 - - - -
Department of Computer Science
Department of Mathematics
The Graduate Center of The City University of New York
Special Topic: TQFT and Computation, Third Lecture.
Speaker: Joshua Sussan, CUNY.
Date and Time: Wednesday February 22, 2023, 7:00 - 8:30 PM. IN PERSON TALK.
Title: Non-semisimple Hermitian TQFTs.
Abstract: Topological quantum field theories coming from semisimple categories build upon interesting structures in representation theory and have important applications in low dimensional topology and physics. The construction of non-semisimple TQFTs is more recent and they shed new light on questions that seem to be inaccessible using their semisimple relatives. In order to have potential applications to physics, these non-semisimple categories and TQFTs should possess Hermitian structures. We will define these structures and give some applications.
- - - - Thursday, Feb 23, 2023 - - - -
- - - - Friday, Feb 24, 2023 - - - -
CUNY Graduate Center
Hybrid: Please email Victoria Gitman (vgitman@gmail.com) for meeting id.
When Gromov asked 'What is a typical group?', he was thinking of finitely presented groups, and he proposed an approach involving limiting density. Here, we reframe this question in the context of universal algebra and discuss some examples illustrating the behaviors of some of these algebraic varieties and then general conditions that imply some of these behaviors. Our primary general result states that for a commutative generalized bijective variety and presentations with a single generator and single identity, the zero-one law holds and, furthermore, that the sentences with density 1 are those true in the free structure. The proof of this result requires a specialized version of Gaifman's Locality Theorem that enables us to get a better bound on the complexity of the formulas of interest to us.
This work is joint with Meng-Che 'Turbo' Ho and Julia Knight.
- - - - Monday, Feb 27, 2023 - - - -
Logic and Metaphysics Workshop
Date: Monday, February 27, 4.15-6.15pm (NY time), GC room TBD
NOTE: Meetings this semester are in person only (no zoom)
For meeting information, please sign up for our mailing list at https://logic.commons.gc.cuny.edu/about/
- - - - Tuesday, Feb 28, 2023 - - - -
Tuesday, February 28, 1:00pm
Virtual (email Victoria Gitman vgitman@gmail.com for meeting id)
Zuzana Hanikova, Czech Academy of Sciences
Vopěnka's Alternative Set Theory and its mathematical context
Vopěnka first presented his Alternative Set Theory (AST) in the monograph 'Mathematics in the Alternative Set Theory' published by Teubner, Leipzig in 1979. Another book presenting the theory, 'Introduction to Mathematics in the Alternative Set Theory', was published in 1989 in Slovak by Alfa, Bratislava. In addition there are numerous journal papers on the AST by members of the research group established by Vopěnka, and the proceedings of a conference dedicated to the AST, also from 1989. In several essays, Vopěnka sought to lay out the motivation and philosophical import of the AST and some of his subsequent work. As one consequence of the emphasis on his philosophy, the mathematical inspiration for the AST has been somewhat obliterated. The aim of the talk is to discuss the design choices Vopěnka made for the AST in relation to pertinent mathematical developments of the 20th century, such as Skolem's work on nonstandard models of arithmetic, Robinson's nonstandard analysis, Rieger's nonstandard models of arithmetic, Vopěnka's nonstandard model of set theory, Vopěnka and Hájek's theory of semisets, or Parikh's almost consistent theories. The presentation will include an outline of the AST following the works of Vopěnka and Sochor. This is a historical talk; no new mathematical results on the AST will be presented.
- - - - Wednesday, Mar 1, 2023 - - - -
- - - - Thursday, Mar 2, 2023 - - - -
- - - - Friday, Mar 3, 2023 - - - -
- - - - Web Site - - - -
Find us on the web at: nylogic.github.io
(site designed, built & maintained by Victoria Gitman)
-------- ADMINISTRIVIA --------
To subscribe/unsubscribe to this list, please email your request to jreitz@nylogic.org.
If you have a logic-related event that you would like included in future mailings, please email jreitz@nylogic.org.
Wednesday seminar
Barcelona Set Theory Seminar
ICREA Research Professor
Universitat de Barcelona
Departament de Matemàtiques i Informàtica
Gran Via de les Corts Catalanes 585
08007 Barcelona
Catalonia
Phone: +34 93 402 1609
joan.bagaria@icrea.cat
bagaria@ub.edu
Logic Seminar Wed 15 Feb 2023 17:00 hrs at NUS by David Belanger
Nankai Logic Colloquium
Hello everyone,
This week our weekly Nankai Logic Colloquium is going to be in the afternoon.
Our speaker this week will be Riccardo Camerlo from University of Genoa. This talk is going to take place this Friday, Feb.17, 2023, from 4 pm to 5 pm (UTC+8, Beijing time).
Title: On some reducibility hierarchies Abstract: The notion of reducibility allows to compare sets or, more generally, relations by using a given class of functions to make the comparison. The choice of different classes of functions may give rise to very diffent hierarchies. Purpose of the talk is to give an elementary presentation of some of these hierarchies, discuss some examples, and comment on some open problems.
This is going to be an online event. Follow the link below to join the Zoom meeting. Please use your real name to join the meeting.
Title: The 16th Nankai Logic Colloquium --Riccardo Camerlo
Time: 16:00pm, Feb. 17, 2023 (Beijing Time)
Zoom Number:839 6396 1742
Passcode: 321054
Link: https://zoom.us/j/83963961742?pwd=c2ppSXpMQks3Vit5bnZkUm5heElNUT09
_____________________________________________________________________
Best wishes,
Ming Xiao
This Week in Logic at CUNY
- - - - Monday, Feb 13, 2023 - - - -
Forcing more choice over the Chang model
- - - - Tuesday, Feb 14, 2023 - - - -
Tuesday, February 14, 1:00pm
Virtual (email Victoria Gitman vgitman@gmail.com for meeting id)
Vladimir Kanovei, Institute for Information Transmission Problems
On the significance of parameters in the choice and сomprehension schemata in the 2nd-order Peano arithmetic
Parameters are free variables in various axiom schemata in PA, ZFC, and other similar theories. Given an axiom schema S, we let S* be the parameter-free sub-schema.
Kreisel (A survey of proof theory, JSL 1968) was one of those who paid attention to the comparison of some schemata in second-order PA and their parameter-free versions. In particular, Kreisel noted that
[...] if one is convinced of the significance of something like a given axiom schema, it is natural to study details, such as the effect of parameters.This talk is devoted to the effect of parameters in the schemata of Comprehension and Choice in second-order arithmetic.
- - - - Wednesday, Feb 15, 2023 - - - -
Department of Computer Science
Department of Mathematics
The Graduate Center of The City University of New York
Special Topic: TQFT and Computation, Second Lecture.
Speaker: Mee Seong Im, United States Naval Academy, Annapolis.
Date and Time: Wednesday February 15, 2023, 7:00 - 8:30 PM. IN PERSON TALK.
Title: Automata and topological theories.
Abstract: Theory of regular languages and finite state automata is part of the foundations of computer science. Topological quantum field theories (TQFT) are a key structure in modern mathematical physics. We will interpret a nondeterministic automaton as a Boolean-valued one-dimensional TQFT with defects labelled by letters of the alphabet for the automaton. We will also describe how a pair of a regular language and a circular regular language gives rise to a lax one-dimensional TQFT.
- - - - Thursday, Feb 16, 2023 - - - -
- - - - Friday, Feb 17, 2023 - - - -
CUNY Graduate Center
Hybrid: Please email Victoria Gitman (vgitman@gmail.com) for meeting id.
Russell Miller, CUNY
Computability and the Absolute Galois Group of
Fix a computable presentation of the algebraic closure of the rational numbers. The absolute Galois group of the rational numbers, which is precisely the automorphism group of the field , may then be viewed as a collection of paths through a finite-branching tree. Each individual automorphism has a Turing degree. We will use known results in computability to try to build natural countable elementary subgroups of the absolute Galois group. Several intriguing questions in number theory will appear as we measure the extent to which we succeed in doing so.
- - - - Monday, Feb 20, 2023 - - - -
- - - - Tuesday, Feb 21, 2023 - - - -
Models of Peano Arithmetic (MOPA)
Tuesday, February 21, 1:00pm
Virtual (email Victoria Gitman vgitman@gmail.com for meeting id)
Alexei Miasnikov, Stevens Institute of Technology
First-order classification and non-standard models
In this talk I will discuss some recent advances in the first-order classification problem. I will touch on first-order rigidity and quasi finite axiomatization. However, the main point of the presentation is on how, in principle, one can describe all structures which are first-order equivalent to a given one. This leads to non-standard models of algebraic structures (aka non-standard analysis or non-standard arithmetic), which are interesting in their own right.
- - - - Wednesday, Feb 22, 2023 - - - -
Department of Computer Science
Department of Mathematics
The Graduate Center of The City University of New York
Special Topic: TQFT and Computation, Third Lecture.
Speaker: Joshua Sussan, CUNY.
Date and Time: Wednesday February 22, 2023, 7:00 - 8:30 PM. IN PERSON TALK.
Title: Non-semisimple Hermitian TQFTs.
Abstract: Topological quantum field theories coming from semisimple categories build upon interesting structures in representation theory and have important applications in low dimensional topology and physics. The construction of non-semisimple TQFTs is more recent and they shed new light on questions that seem to be inaccessible using their semisimple relatives. In order to have potential applications to physics, these non-semisimple categories and TQFTs should possess Hermitian structures. We will define these structures and give some applications.
- - - - Thursday, Feb 23, 2023 - - - -
- - - - Friday, Feb 24, 2023 - - - -
CUNY Graduate Center
Hybrid: Please email Victoria Gitman (vgitman@gmail.com) for meeting id.
- - - - Web Site - - - -
Find us on the web at: nylogic.github.io
(site designed, built & maintained by Victoria Gitman)
-------- ADMINISTRIVIA --------
To subscribe/unsubscribe to this list, please email your request to jreitz@nylogic.org.
If you have a logic-related event that you would like included in future mailings, please email jreitz@nylogic.org.
Wednesday seminar
Barcelona Set Theory Seminar
DATE: Wednesday, 15 February 2023
ICREA Research Professor
Universitat de Barcelona
Departament de Matemàtiques i Informàtica
Gran Via de les Corts Catalanes 585
08007 Barcelona
Catalonia
Phone: +34 93 402 1609
joan.bagaria@icrea.cat
bagaria@ub.edu
Nankai Logic Colloquium
Hello everyone,
This week our weekly Nankai Logic Colloquium is going to be in the afternoon.
Our speaker this week will be Anush Tserunyan from McGill University. This talk is going to take place this Friday, Feb.10, 2023, from 4 pm to 5 pm (UTC+8, Beijing time).
___________________________________________________________________________________________________________________________________________________
This is going to be an online event. Follow the link below to join the Zoom meeting. Please use your real name to join the meeting.
_____________________________________________________________________
Best wishes,
Ming Xiao
Logic Seminar Wed 8 Feb 2023 17:00 hrs at NUS via Zoom by Will Johnson
UPDATE: This Week in Logic at CUNY
Hopfian groups are complete co-analytic
- - - - Tuesday, Feb 7, 2023 - - - -
Models of Peano Arithmetic (MOPA)
Tuesday, February 7, 1:00pm
Virtual (email Victoria Gitman vgitman@gmail.com for meeting id)
Mikhail Katz, Bar Ilan University
Effective infinitesimals in R
We survey the effective foundations for analysis with infinitesimals recently developed by Hrbacek and Katz, and detail some applications. Theories SPOT and SCOT illustrate the fact that analysis with infinitesimals requires no more choice than traditional analysis. The theory SCOT incorporates in particular all the axioms of Nelson's Radically Elementary Probability Theory, which is therefore conservative over ZF+ADC.
- - - - Wednesday, Feb 8, 2023 - - - -
Department of Computer Science
Department of Mathematics
The Graduate Center of The City University of New York
Special Topic: TQFT and Computation, First Lecture.
Speaker: Mikhail Khovanov, Columbia University.
Date and Time: Wednesday February 8, 2023, 7:00 - 8:30 PM. IN PERSON TALK.
Title: Universal construction and its applications.
Abstract: Universal construction starts with an evaluation of closed n-manifolds and builds a topological theory (a lax TQFT) for n-cobordisms. A version of it has been used for years as an intermediate step in constructing link homology theories, by evaluating foams embedded in 3-space. More recently, universal construction in low dimensions has been used to find interesting structures related to Deligne categories, formal languages and automata. In the talk we will describe the universal construction and review these developments.
- - - - Thursday, Feb 9, 2023 - - - -
- - - - Friday, Feb 10, 2023 - - - -
CUNY Graduate Center, Friday, February 10, 12:15pm NY time
Virtual: Please email Victoria Gitman (vgitman@gmail.com) for meeting id.
Strategy and determinacy in infinite Hex
The popular game of Hex can be extended to the infinite hexagonal lattice, defining a winning condition which formalises the idea of a chain of colored stones stretching towards infinity. The descriptive-set-theoretic complexity of the set of winning positions is unknown, although it is at most Σ^1_1, and it is conjectured to be Borel; this has implications on whether games of infinite Hex are determined from all initial positions as either first-player wins or draws.
I will show that, unlike the finite game, infinite Hex with an initially empty board is a draw. But is the game still a draw when starting from a non-empty board? This open question can be partially answered in the positive by assuming the existence of certain local strategies, and in the negative by giving the advantage of placing two stones at each turn to one of the players. This is joint work with Joel David Hamkins.
CUNY Graduate Center
Hybrid: Please email Victoria Gitman (vgitman@gmail.com) for meeting id.
Athar Abdul-Quader, Purchase College
Satisfaction and saturation
It is well known that a countable model of PA has a truth predicate if and only if it is recursively saturated. It is also well known that not all countable recursively saturated models of PA have *inductive* or even -inductive truth predicates: indeed, such models must satisfy Con(PA), for example. Recent work by Enayat-Pakhomov and Cieśliński-Łełyk-Wcisło explored the principle of 'disjunctive correctness', asserting that every disjunction is true if and only if it has a true disjunct. In particular, one can show that every countable model of PA has a 'disjunctively trivial' elementary extension: that is, an elementary extension with a truth predicate in which all nonstandard length disjunctions are evaluated as true. In this talk, we will see that such 'disjunctively trivial' models are necessarily arithmetically saturated; indeed, we will see that a countable model of PA is arithmetically saturated if and only if it has a disjunctively trivial truth predicate. We will explore related pathologies in truth predicates, and classify the sets which can be defined using such pathologies. We find other surprising connections between arithmetic saturation and these questions of definability. This is joint work with Mateusz Łełyk, based heavily on unpublished work by Jim Schmerl.
- - - - Monday, Feb 13, 2023 - - - -
- - - - Tuesday, Feb 14, 2023 - - - -
Tuesday, February 14, 1:00pm
Virtual (email Victoria Gitman vgitman@gmail.com for meeting id)
Vladimir Kanovei, Institute for Information Transmission Problems
On the significance of parameters in the choice and сomprehension schemata in the 2nd-order Peano arithmetic
Parameters are free variables in various axiom schemata in PA, ZFC, and other similar theories. Given an axiom schema S, we let S* be the parameter-free sub-schema.
Kreisel (A survey of proof theory, JSL 1968) was one of those who paid attention to the comparison of some schemata in second-order PA and their parameter-free versions. In particular, Kreisel noted that
[...] if one is convinced of the significance of something like a given axiom schema, it is natural to study details, such as the effect of parameters.This talk is devoted to the effect of parameters in the schemata of Comprehension and Choice in second-order arithmetic.
- - - - Wednesday, Feb 15, 2023 - - - -
Department of Computer Science
Department of Mathematics
The Graduate Center of The City University of New York
Special Topic: TQFT and Computation, First Lecture.
Speaker: Mee Seong Im, United States Naval Academy, Annapolis.
Date and Time: Wednesday February 15, 2023, 7:00 - 8:30 PM. IN PERSON TALK.
Title: Automata and topological theories.
Abstract: Theory of regular languages and finite state automata is part of the foundations of computer science. Topological quantum field theories (TQFT) are a key structure in modern mathematical physics. We will interpret a nondeterministic automaton as a Boolean-valued one-dimensional TQFT with defects labelled by letters of the alphabet for the automaton. We will also describe how a pair of a regular language and a circular regular language gives rise to a lax one-dimensional TQFT.
- - - - Thursday, Feb 16, 2023 - - - -
- - - - Friday, Feb 17, 2023 - - - -
CUNY Graduate Center
Hybrid: Please email Victoria Gitman (vgitman@gmail.com) for meeting id.
Russell Miller, CUNY
Computability and the Absolute Galois Group of
Fix a computable presentation of the algebraic closure of the rational numbers. The absolute Galois group of the rational numbers, which is precisely the automorphism group of the field , may then be viewed as a collection of paths through a finite-branching tree. Each individual automorphism has a Turing degree. We will use known results in computability to try to build natural countable elementary subgroups of the absolute Galois group. Several intriguing questions in number theory will appear as we measure the extent to which we succeed in doing so.
- - - - Web Site - - - -
Find us on the web at: nylogic.github.io
(site designed, built & maintained by Victoria Gitman)
-------- ADMINISTRIVIA --------
To subscribe/unsubscribe to this list, please email your request to jreitz@nylogic.org.
If you have a logic-related event that you would like included in future mailings, please email jreitz@nylogic.org.
This Week in Logic at CUNY
Hopfian groups are complete co-analytic
- - - - Tuesday, Feb 7, 2023 - - - -
Models of Peano Arithmetic (MOPA)
Tuesday, February 7, 1:00pm
Virtual (email Victoria Gitman vgitman@nylogic.org for meeting id)
Mikhail Katz, Bar Ilan University
Effective infinitesimals in R
We survey the effective foundations for analysis with infinitesimals recently developed by Hrbacek and Katz, and detail some applications. Theories SPOT and SCOT illustrate the fact that analysis with infinitesimals requires no more choice than traditional analysis. The theory SCOT incorporates in particular all the axioms of Nelson's Radically Elementary Probability Theory, which is therefore conservative over ZF+ADC.
- - - - Wednesday, Feb 8, 2023 - - - -
Department of Computer Science
Department of Mathematics
The Graduate Center of The City University of New York
Special Topic: TQFT and Computation, First Lecture.
Speaker: Mikhail Khovanov, Columbia University.
Date and Time: Wednesday February 8, 2023, 7:00 - 8:30 PM. IN PERSON TALK.
Title: Universal construction and its applications.
Abstract: Universal construction starts with an evaluation of closed n-manifolds and builds a topological theory (a lax TQFT) for n-cobordisms. A version of it has been used for years as an intermediate step in constructing link homology theories, by evaluating foams embedded in 3-space. More recently, universal construction in low dimensions has been used to find interesting structures related to Deligne categories, formal languages and automata. In the talk we will describe the universal construction and review these developments.
- - - - Thursday, Feb 9, 2023 - - - -
- - - - Friday, Feb 10, 2023 - - - -
CUNY Graduate Center, Friday, February 10, 12:15pm NY time
Virtual: Please email Victoria Gitman (vgitman@nylogic.org) for meeting id.
Strategy and determinacy in infinite Hex
The popular game of Hex can be extended to the infinite hexagonal lattice, defining a winning condition which formalises the idea of a chain of colored stones stretching towards infinity. The descriptive-set-theoretic complexity of the set of winning positions is unknown, although it is at most Σ^1_1, and it is conjectured to be Borel; this has implications on whether games of infinite Hex are determined from all initial positions as either first-player wins or draws.
I will show that, unlike the finite game, infinite Hex with an initially empty board is a draw. But is the game still a draw when starting from a non-empty board? This open question can be partially answered in the positive by assuming the existence of certain local strategies, and in the negative by giving the advantage of placing two stones at each turn to one of the players. This is joint work with Joel David Hamkins.
CUNY Graduate Center
Hybrid: Please email Victoria Gitman (vgitman@nylogic.org) for meeting id.
Friday February 10, 2:00pm-3:30pm, Room 6417
Athar Abdul-Quader, Purchase College
Satisfaction and saturation
It is well known that a countable model of PA has a truth predicate if and only if it is recursively saturated. It is also well known that not all countable recursively saturated models of PA have *inductive* or even -inductive truth predicates: indeed, such models must satisfy Con(PA), for example. Recent work by Enayat-Pakhomov and Cieśliński-Łełyk-Wcisło explored the principle of 'disjunctive correctness', asserting that every disjunction is true if and only if it has a true disjunct. In particular, one can show that every countable model of PA has a 'disjunctively trivial' elementary extension: that is, an elementary extension with a truth predicate in which all nonstandard length disjunctions are evaluated as true. In this talk, we will see that such 'disjunctively trivial' models are necessarily arithmetically saturated; indeed, we will see that a countable model of PA is arithmetically saturated if and only if it has a disjunctively trivial truth predicate. We will explore related pathologies in truth predicates, and classify the sets which can be defined using such pathologies. We find other surprising connections between arithmetic saturation and these questions of definability. This is joint work with Mateusz Łełyk, based heavily on unpublished work by Jim Schmerl.
- - - - Monday, Feb 13, 2023 - - - -
- - - - Tuesday, Feb 14, 2023 - - - -
Tuesday, February 14, 1:00pm
Virtual (email Victoria Gitman vgitman@nylogic.org for meeting id)
Vladimir Kanovei, Institute for Information Transmission Problems
On the significance of parameters in the choice and сomprehension schemata in the 2nd-order Peano arithmetic
Parameters are free variables in various axiom schemata in PA, ZFC, and other similar theories. Given an axiom schema S, we let S* be the parameter-free sub-schema.
Kreisel (A survey of proof theory, JSL 1968) was one of those who paid attention to the comparison of some schemata in second-order PA and their parameter-free versions. In particular, Kreisel noted that
[...] if one is convinced of the significance of something like a given axiom schema, it is natural to study details, such as the effect of parameters.This talk is devoted to the effect of parameters in the schemata of Comprehension and Choice in second-order arithmetic.
- - - - Wednesday, Feb 15, 2023 - - - -
Department of Computer Science
Department of Mathematics
The Graduate Center of The City University of New York
Special Topic: TQFT and Computation, First Lecture.
Speaker: Mee Seong Im, United States Naval Academy, Annapolis.
Date and Time: Wednesday February 15, 2023, 7:00 - 8:30 PM. IN PERSON TALK.
Title: Automata and topological theories.
Abstract: Theory of regular languages and finite state automata is part of the foundations of computer science. Topological quantum field theories (TQFT) are a key structure in modern mathematical physics. We will interpret a nondeterministic automaton as a Boolean-valued one-dimensional TQFT with defects labelled by letters of the alphabet for the automaton. We will also describe how a pair of a regular language and a circular regular language gives rise to a lax one-dimensional TQFT.
- - - - Thursday, Feb 16, 2023 - - - -
- - - - Friday, Feb 17, 2023 - - - -
CUNY Graduate Center
Hybrid: Please email Victoria Gitman (vgitman@nylogic.org) for meeting id.
Friday February 17, 2:00pm-3:30pm, Room 6417
Russell Miller, CUNY
Computability and the Absolute Galois Group of
Fix a computable presentation of the algebraic closure of the rational numbers. The absolute Galois group of the rational numbers, which is precisely the automorphism group of the field , may then be viewed as a collection of paths through a finite-branching tree. Each individual automorphism has a Turing degree. We will use known results in computability to try to build natural countable elementary subgroups of the absolute Galois group. Several intriguing questions in number theory will appear as we measure the extent to which we succeed in doing so.
- - - - Web Site - - - -
Find us on the web at: nylogic.github.io
(site designed, built & maintained by Victoria Gitman)
-------- ADMINISTRIVIA --------
To subscribe/unsubscribe to this list, please email your request to jreitz@nylogic.org.
If you have a logic-related event that you would like included in future mailings, please email jreitz@nylogic.org.
Wednesday seminar
Core model seminar next Tuesday
Core Model Seminar: 1:30-3 PM Eastern Online, Gabriel Goldberg, University of California, Berkeley
Join Zoom Meeting: https://cmu.zoom.us/j/97749733438?pwd=Yk5PcSsvekptWWxMNUhCU2pFbzA0Zz09
Meeting ID: 977 4973 3438
Passcode: 457791
TITLE: Inner models from stationary logic, part 1
CMU math logic seminar next Tuesday
Mathematical Logic Seminar: 3:30-4:30 PM Eastern, Online, Tom Benhamou, University of Illinois at Chicago
Join Zoom Meeting: https://cmu.zoom.us/j/92655324096?pwd=VUhSSlkrdHMxbTlSYUMxYzFXM01kdz09
Meeting ID: 926 5532 4096
Passcode: 555455
TITLE: Saturation properties of ultrafilters
ABSTRACT: In this talk, we will focus on certain saturation properties of filters and ultrafilters which generalizes the so-called Galvin property. In the first part of the talk, we will present a connection between such ultrafilters and the existence of Slim-Kurepa trees. We will then present several results regarding the existence of non-Galvin ultrafilters under several large cardinal assumptions. Finally, if time permits, we will present a recent application to canonical inner models and some open related questions.
Logic Seminar 1 Feb 2023 17:00 hrs at NUS by Yu Liang, Nanjing University
Reminder for today's Talk
Cross-Alps Logic Seminar (speaker: Katarzyna Kowalik)
Katarzyna Kowalik (University of Warsaw)
will give a talk on
Reverse mathematics of some Ramsey-theoretic principles over a weak base theory
Please refer to the usual webpage of our LogicGroup for more details and the abstract of the talk.
The seminar will be held remotely through Webex. Please write to vincenzo.dimonte [at] uniud [dot] it for the link to the event.
The Cross-Alps Logic Seminar is co-organized by the logic groups of Genoa, Lausanne, Turin and Udine as part of our collaboration in the project PRIN 2017 'Mathematical logic: models, sets, computability'.
This Week in Logic at CUNY
- - - - Tuesday, Jan 24, 2023 - - - -
Models of Peano Arithmetic (MOPA)
Tuesday, January 24, 1:00pm
Virtual (email Victoria Gitman vgitman@nylogic.org for meeting id)
Karel Hrbacek, CUNY
Representation of unlimited integers
Nonstandard methods have been successfully applied to standard problems in number theory by R. Jin, T. Tao and others. A. Boudaoud and D. Bellaouar are pursuing the opposite direction: they are formulating number-theoretic problems in the language of nonstandard analysis and solving them by standard methods. Two examples of the kind of questions they consider are:
(1) Can every unlimited natural number n be represented in the form n = s + w_1w_2 where s is a limited integer and w_1, w_2 are unlimited?
(2) Can every unlimited natural number n be represented in the form n = w_1w_2 + w_3w_4 so that each ratio w_i / w_j is appreciable (ie, neither infinitesimal nor unlimited)?
I give a negative answer to question (1) (assuming Dickson’s Conjecture) and a positive answer to question (2).
A. Boudaoud, D. Bellaouar, Representation of integers: A nonclassical point of view, Journal of Logic & Analysis. 12:4 (2020) 1{31; K. Hrbacek, Journal of Logic & Analysis 12:5 (2020) 1–6.
- - - - Wednesday, Jan 25, 2023 - - - -
- - - - Thursday, Jan 26, 2023 - - - -
- - - - Friday, Jan 27, 2023 - - - -
- - - - Saturday, Jan 28, 2023 - - - -
Fitting at 80
Saturday, January 28
A prominent logician Melvin Fitting has turned 80. This online conference is a special event in his honor. Melvin Fitting was in the departments of Computer Science, Philosophy, and Mathematics at the CUNY Graduate Center and in the department of Mathematics and Computer Science at Lehman College. He is now Professor Emeritus. He has authored 11 books and over a hundred research papers with staggering citation figures. In 2012 Melvin Fitting was given the Herbrand Award by the Conference on Automated Deduction (CADE) for distinguished contributions to the field.
Greetings, congratulations, photos for posting, and ZOOM link requests could be sent to Sergei Artemov by sartemov@gmail.com or sartemov@gc.cuny.edu.
Conference website https://sartemov.ws.gc.cuny.edu/fitting-at-80/
Program (the times are given in the Eastern Day Time zone EST).
January 28, Saturday
8:00-8:45 am Arnon Avron (Tel Aviv), “Breaking the Tie: Benacerraf’s Identification Argument Revisited”
8:45-9:30 am Junhua Yu (Beijing), "Exploring Operators on Neighborhood Models"
9:45-10:30 am Sara Negri (Genoa), "Faithful Modal Embedding: From Gödel to Labelled Calculi"
10:30-11:15 am Heinrich Wansing (Bochum), “Remarks on Semantic Information and Logic. From Semantic Tetralateralism to the Pentalattice 65536_5”
11:30 am -12:15 pm Roman Kuznets (Vienna), "On Interpolation"
12:15-1:00 pm Walter Carnielli (Campinas), “Combining KX4 and S4: A Logic That Encompasses Factive and Non-factive Evidence”
1:15-2:00 pm Eduardo Barrio and Federico Pailos (Buenos Aires), “Meta-classical Non-classical Logics”
2:00-2:45 pm Graham Priest (New York), "Jaśkowski and the Jains: a Fitting Tribute"
2:45-4:00 pm Session of memories and congratulations featuring Sergei Artemov, Hiroakira Ono, Anil Nerode, Melvin Fitting, and others.
Next Week in Logic at CUNY:
- - - - Monday, Jan 30, 2023 - - - -
- - - - Tuesday, Jan 31, 2023 - - - -
Models of Peano Arithmetic (MOPA)
Tuesday, January 31, 1:00pm
Virtual (email Victoria Gitman vgitman@nylogic.org for meeting id)
Lorenzo Galeotti, Amsterdam University College
Order types of models of arithmetic without induction
It is a well-known fact that non-standard models of Peano Arithmetic (PA) have order type N + Z · D, where D is a dense linear order. The question of which dense linear orders D can occur in such order types is non-trivial and widely studied. In this context Friedman asked the following question:
Are there consistent extensions of Peano Arithmetic T and T′ such that the class of order types of models of T and the class of order types of models of T′ differ?
Friedman’s question is very complex and still wide open. In this talk we will go in the opposite direction and consider a version of Friedman’s question for syntactic fragments of PA. We will present results from a joint work with Benedikt Löwe on order types of non-standard models of syntactic subsystems of arithmetic obtained by restricting the language to subsets of the operations. We will put particular emphasis on models of syntactic subsystems of Peano Arithmetic obtained by dropping the schema of induction.- - - - Wednesday, Feb 1, 2023 - - - -
- - - - Thursday, Feb 2, 2023 - - - -
- - - - Friday, Feb 3, 2023 - - - -
CUNY Graduate Center, Friday, February 3, 12:30pm NY time
Virtual: Please email Victoria Gitman (vgitman@nylogic.org) for meeting id.
- - - - Other Logic News - - - -
- - - - Web Site - - - -
Find us on the web at: nylogic.github.io
(site designed, built & maintained by Victoria Gitman)
-------- ADMINISTRIVIA --------
To subscribe/unsubscribe to this list, please email your request to jreitz@nylogic.org.
If you have a logic-related event that you would like included in future mailings, please email jreitz@nylogic.org.
Wednesday seminar
(KGRC) guests, video, and a talk on Thursday, January 26
Logic Seminar Wed 18 Jan 2023 17:00 hrs at NUS by Bakhadyr Khoussainov
Descriptive Set Theory and Dynamics: Warsaw, Poland, August 14-25, 2023
CMU Math Logic Seminar next Tuesday
Wednesday seminar
(KGRC) Set Theory Seminar talk on Tuesday, January 17
Logic Seminar Wed 18 Jan 2023 17:00 hrs at NUS by Bakhadyr Khoussainov
Core Model Seminar starting again in two weeks
Cross-Alps Logic Seminar for World Logic Day (speaker: Vasco Brattka)
On Friday 13.01.2023 at 16:00
on the occasion of World Logic Day 2023, a special session of the Cross-Alps Logic Seminars will take place, with special guest
Vasco Brattka (Universität der Bundeswehr München)
who will give a talk on
Some fascinating topics in logic around reducibilities
Please refer to the usual webpage of our LogicGroup for more details and the abstract of the talk.
The seminar will be held remotely through Webex. Please write to vincenzo.dimonte [at] uniud [dot] it for the link to the event.
The Cross-Alps Logic Seminar is co-organized by the logic groups of Genoa, Lausanne, Turin and Udine as part of our collaboration in the project PRIN 2017 'Mathematical logic: models, sets, computability'.