activity
20132019
most citedSet-Theoretic Blockchains

9 citations · 15 across the 6 of their papers we have counts for

collaborators

6 papers

math.LO2019

Capturing sets of ordinals by normal ultrapowers

Miha E. Habič, Radek Honzík

We investigate the extent to which ultrapowers by normal measures on can be correct about powersets for . We consider two versions of this questions, the…

math.LO2018★ 9 cited

Set-Theoretic Blockchains

Miha E. Habič, Joel David Hamkins, Lukas Daniel Klausner +2

Given a countable model of set theory, we study the structure of its generic multiverse, the collection of its forcing extensions and ground models, ordered by inclusion. Mostowski…

math.LO2017★ 1 cited

Joint diamonds and Laver diamonds

Miha E. Habič

The concept of jointness for guessing principles, specifically and various Laver diamonds, is introduced. A family of guessing sequences is joint if the elements o…

math.LO2016

The grounded Martin's axiom

Miha E. Habič

We introduce a variant of Martin's axiom, called the grounded Martin's axiom, which asserts that the universe is a ccc forcing extension in which Martin's axiom holds for posets in…

math.LO2016★ 2 cited

A Mitchell-like order for Ramsey and Ramsey-like cardinals

Erin Carmody, Victoria Gitman, Miha E. Habič

Smallish large cardinals are often characterized by the existence of a collection of filters on , each of which is an ultrafilter on the subsets of of some transitive $\…

math.LO2013★ 3 cited

Cardinal-Recognizing Infinite Time Turing Machines

Miha E. Habič

We introduce a model of infinitary computation which enhances the infinite time Turing machine model slightly but in a natural way by giving the machines the capability of detectin…