Bounding 2d functions by products of 1d functions

&
Mathematical Logic Quarterly 68 (2):202-212 (2022)
  Copy   BIBTEX

Abstract

Given sets and a regular cardinal μ, let be the statement that for any function, there are functions and such that for all,. In, the statement is false. However, we show the theory (which is implied by + “” + “ω1 is measurable”) implies that for every there is a such that in some inner model, κ is measurable with Mitchell order.

Categories

Add categories

Keywords

Reprint years

DOI

10.1002/malq.202000008

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,386

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Bounding and Dominating Number of Families of Functions on ω.Claude Laflamme - 1994 - Mathematical Logic Quarterly 40 (2):207-223.
Evolution's gift is the right account of the origin of recoding functions.Andrew Wells - 1997 - Behavioral and Brain Sciences 20 (1):83-83.
Bounding Prime Models.Barbara F. Csima, Denis R. Hirschfeldt, Julia F. Knight & Robert I. Soare - 2004 - Journal of Symbolic Logic 69 (4):1117 - 1142.
On the Number of Simple Bases of Boolean Functions.On Superpositions of Functions in P k.Investigation of some Classes of Functions in Multivalued Logics.On some Properties of Essential Functions from P k. [REVIEW]Arto Salomaa, G. A. Sestopal, E. Mendelson, S. V. Ablonskij, V. V. Martynuk & E. U. Zaharov - 1966 - Journal of Symbolic Logic 31 (3):501.
On the identification of properties and propositional functions.George Bealer - 1989 - Linguistics and Philosophy 12 (1):1 - 14.
Variations on a theme by Weiermann.Toshiyasu Arai - 1998 - Journal of Symbolic Logic 63 (3):897-925.
Methods and Software for Computing Mathematical Functions-A Matlab Implementation of an Algorithm for Computing Integrals of Products of Bessel Functions.Joris Van Deun & Ronald Cools - 2006 - In O. Stock & M. Schaerf (eds.), Lecture Notes in Computer Science. Springer Verlag. pp. 284-295.
Plain Bases for Classes of Primitive Recursive Functions.Stefano Mazzanti - 2002 - Mathematical Logic Quarterly 48 (1):93-104.
Products of non-additive measures: a Fubini-like theorem.Christian Bauer - 2012 - Theory and Decision 73 (4):621-647.
On a complexity-based way of constructivizing the recursive functions.F. W. Kroon & W. A. Burkhard - 1990 - Studia Logica 49 (1):133 - 149.
Local connectedness and distance functions.Charles Morgan - unknown
Lp-Circular Functions.Bruce MacLennan - unknown
Tau functions for the Dirac operator on the Poincare' disk.Palmer John, Beatty Morris & A. Tracy Craig - unknown
Uniformly computable aspects of inner functions: estimation and factorization.Timothy H. McNicholl - 2008 - Mathematical Logic Quarterly 54 (5):508-518.
Functions as Epistemic Highlighters: An Engineering Account of Technical, Biological and Other Functions.Pieter E. Vermaas & Wybo Houkes - 2013 - In Philippe Huneman (ed.), Functions: Selection and Mechanisms. Springer. pp. 213--231.

Analytics

Added to PP
2022-04-10

Downloads
10 (#1,165,120)

6 months
6 (#504,917)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Maker–Breaker Games on And.Nathan Bowler, Florian Gut, Attila Joó & Max Pitz - forthcoming - Journal of Symbolic Logic:1-7.

Add more citations

References found in this work

Happy families.A. R. D. Mathias - 1977 - Annals of Mathematical Logic 12 (1):59.
Set Theory.Thomas Jech - 1999 - Studia Logica 63 (2):300-300.
$K$ without the measurable.Ronald Jensen & John Steel - 2013 - Journal of Symbolic Logic 78 (3):708-734.
Characterising subsets of ω1 constructible from a real.P. D. Welch - 1994 - Journal of Symbolic Logic 59 (4):1420 - 1432.

View all 7 references / Add more references