The immediate history of relations between man and nature is marked by mutual conflict. Until recently, nature had supremacy over man through the force of its natural power. During this period, the encounter with nature for man was a conflict with wholly implacable forces. Advances in science and technology have in some cases tamed the forces of nature, and now man can carry out planned and systematic violence against it. In so doing, he came to a privileged, but also sinful (...) relationship with nature. The end result proved devastating for both nature and for man. Man's quality of life has increased, but at an unacceptable cost for the environment, especially considering that both man and nature will be in dire straits in the not-so-distant future. It is urgent that man, as a reasonable officer of nature, finds ways to reconcile his relationship with nature. (shrink)

We provide a novel Bayesian justification of inference to the best explanation. More specifically, we present conditions under which explanatory considerations can provide a significant confirmatory boost for hypotheses that provide the best explanation of the relevant evidence. Furthermore, we show that the proposed Bayesian model of IBE is able to deal naturally with the best known criticisms of IBE such as van Fraassen?s?bad lot? argument.

In their 2010 paper, Dizadji-Bahmani, Frigg, and Hartmann argue that the generalized version of the Nagel–Schaffner model that they have developed is the right one for intertheoretic reduction, i.e. the kind of reduction that involves theories with largely overlapping domains of application. Drawing on the GNS, DFH presented a Bayesian analysis of the confirmatory relation between the reducing theory and the reduced theory and argued that, post-reduction, evidence confirming the reducing theory also confirms the reduced theory and evidence confirming the (...) reduced theory also confirms the reducing theory, which meets the expectations one has about theories with largely overlapping domains. In this paper, I argue that the Bayesian analysis presented by DFH faces difficulties. In particular, I argue that the conditional probabilities that DFH introduce to model the bridge law entail consequences that run against the GNS. However, I also argue that, given slight modifications of the analysis that are in agreement with the GNS, one is able to account for these difficulties and, moreover, one is able to more rigorously analyse the confirmatory relation between the reducing and the reduced theory. (shrink)

Bearing on mind the idea of the proverb “Justice Delayed is Justice Denied” Macedonian Legislator within the new Code of Criminal Procedure has introduced several legal mechanisms for accelerating the criminal procedure. The most important instruments among them, by all means, are the Guilty Plea and Sentence Bargaining. In this article, the author elaborates the practical implementation of these CPC’s provisions and performs analysis of its implementation by the Basic Court Skopje 1 in Skopje, as the biggest and most caseload-burdened (...) court in Macedonia, and by the Public Prosecution Office in Skopje. The analysis discovered several weak points, which should be properly addressed, both through theoretical scrutiny and through introduction of amendments to the CPC or through production of a general opinion by the Supreme Court. Only through these amendments to the legal provisions of the CPC can be expected to have improved court practice in a manner which would accentuate the real/just benefits of these instruments for accelerating of the criminal procedure. Several conclusions and suggestions for improvement or specific issues, which were determined as problematic were developed, such as: tackling the impact of a guilty plea by one of the codefendants to the other codefendants who did not plead guilty; treatment of the altered statement by one of the codefendants during the plea agreement and its use against the other codefendant; and the burden of proof and amount of evidence which is necessary to support the sentence bargaining process. (shrink)

We define what it means for a function on ω1 to be a collapsing function for λ and show that if there exists a collapsing function for +, then there is no precipitous ideal on ω1. We show that a collapsing function for ω2 can be added by forcing. We define what it means to be a weakly ω1-Erdös cardinal and show that in L[E], there is a collapsing function for λ iff λ is less than the least weakly ω1-Erdös (...) cardinal. As a corollary to our results and a theorem of Neeman, the existence of a Woodin limit of Woodin cardinals does not imply the existence of precipitous ideals on ω1. We also show that the following statements hold in L[E]. The least cardinal λ with the Chang property ↠ is equal to the least ω1-Erdös cardinal. In particular, if j is a generic elementary embedding that arises from non-stationary tower forcing up to a Woodin cardinal, then the minimum possible value of j is the least ω1-Erdös cardinal. (shrink)

We consider the possible complexity of the set of reals belonging to an inner model M of set theory. We show that if this set is analytic then either 1M is countable or else all reals are in M. We also show that if an inner model contains a superperfect set of reals as a subset then it contains all reals. On the other hand, it is possible to have an inner model M whose reals are an uncountable Fσ set (...) and which does not have all reals. A similar construction shows that there can be an inner model M which computes correctly 1, contains a perfect set of reals as a subset and yet not all reals are in M. These results were motivated by questions of H. Friedman and K. Prikry. (shrink)

We present a direct proof of the consistency of the existence of a five element basis for the uncountable linear orders. Our argument is based on the approach of König, Larson, Moore and Veličković and simplifies the original proof of Moore.

Maharam algebras are complete Boolean algebras carrying a positive continuous submeasure. They were introduced and studied by Maharam [D. Maharam, An algebraic characterization of measure algebras, Ann. of Math. 48 154–167] in relation to Von Neumann’s problem on the characterization of measure algebras. The question whether every Maharam algebra is a measure algebra has been the main open problem in this area for around 60 years. It was finally resolved by Talagrand [M. Talagrand, Maharam’s problem, preprint, 31 pages, 2006] who (...) provided the first example of a Maharam algebra which is not a measure algebra. In this paper we survey some recent work on Maharam algebras in relation to the two conditions proposed by Von Neumann: weak distributivity and the countable chain condition. It turns out that by strengthening either one of these conditions one obtains a ZFC characterization of Maharam algebras. We also present some results on Maharam algebras as forcing notions showing that they share some of the well-known properties of measure algebras. (shrink)

We show that it is relatively consistent with ZFC to have PCF structures of heightδ, for all ordinalsδ<ω3.

Starting with two supercompact cardinals we produce a generic extension of the universe in which a principle that we call GM+ holds. This principle implies ISP and ISP, and hence th...

We isolate a condition on a class A of ordinals sufficient to Δ1-code it by a real in a class-generic extension of L. We then apply this condition to show that the class of ordinals of L-cofinality ω is Δ1 in a real of L-degree strictly below O#.

In this paper, we reconsider the notion of epistemic trespassing and attempt to explore possible scenarios in which it could lead to positive outcomes in scientific research and information dissemination. As we will point out, some of the significant discoveries in the history of science would not have been possible were it not for the epistemic trespassers, whose shift in paradigm changed the approach to specific issues for the better. Furthermore, we will present instances where individuals, often labeled as ‘trespassers’ (...) – those who venture into fields outside their expertise – can be considered trustworthy and reliable sources of testimony. Consequently, epistemic trespassing turned out to be essential for the advancement of science. Epistemic trespassing in our age is virtually inevitable – whether it be from a political perspective (to preserve democratic values) or due to purely practical reasons (i.e. searching for information online). There are interdisciplinary fields where a strictly negative characterization of epistemic trespassing would question their methodology since these disciplines rely on experts from various fields. For these reasons, we advocate for a more charitable approach to epistemic trespassing and greater public education to help them distinguish between correct and false information. (shrink)

Synchronic intertheoretic reductions are an important field of research in science. Arguably, the best model able to represent the main relations occurring in this kind of scientific reduction is the Nagelian account of reduction, a model further developed by Schaffner and nowadays known as the generalized version of the Nagel–Schaffner model. In their article, Dizadji-Bahmani, Frigg, and Hartmann specified the two main desiderata of a reduction á la GNS: confirmation and coherence. DFH first and, more rigorously, Tešic later analyse the (...) confirmatory relation between the reducing and the reduced theory in terms of Bayesian confirmation theory. The purpose of this article is to analyse and compare the degree of coherence between the two theories involved in the GNS before and after the reduction. For this reason, in the first section, I will be looking at the reduction of thermodynamics to statistical mechanics and use it as an example to describe the GNS. In the second section, I will introduce three coherence measures which will then be employed in the comparison. Finally, in the last two sections, I will compare the degrees of coherence between the reducing and the reduced theory before and after the reduction and use a few numerical examples to understand the relation between coherence and confirmation measures. (shrink)

We prove that there is a -ideal of compact sets which is strictly above in the Tukey order. Here is the collection of all compact nowhere dense subsets of the Cantor set. This answers a question of Louveau and Veličković asked in [Alain Louveau, Boban Veličković, Analytic ideals and cofinal types, Ann. Pure Appl. Logic 99 171–195].

The Theme. Strong forcing axioms like Martin’s Maximum give a reasonably satisfactory structural analysis of $H(\omega _2)$. A broad program in modern Set Theory is searching for strong forcing axioms beyond $\omega _1$. In other words, one would like to figure out the structural properties of taller initial segments of the universe. However, the classical techniques of forcing iterations seem unable to bypass the obstacles, as the resulting forcings axioms beyond $\omega _1$ have not thus far been strong enough! However, (...) with his celebrated work on generalised side conditions, I. Neeman introduced us to a novel paradigm to iterate forcings. In particular, he could, among other things, reprove the consistency of the Proper Forcing Axiom using an iterated forcing with finite supports. In 2015, using his technology of virtual models, Veličković built up an iteration of semi-proper forcings with finite supports, hence reproving the consistency of Martin’s Maximum, an achievement leading to the notion of a virtual model.In this thesis, we are interested in constructing forcing notions with finitely many virtual models as side conditions to preserve three uncountable cardinals. The thesis constitutes six chapters and three appendices that amount to 118 pages, where Section 1 is devoted to preliminaries, and Section 2 is a warm-up about the scaffolding poset of a proper forcing. In Section 3, we present the general theory of virtual models in the context of forcing with sets of models of two types, where we, e.g., define the “meet” between two virtual models and prove its properties.The main results are joint with Boban Veličković, and partly appeared in Guessing models and the approachability ideal, J. Math. Log. 21 (2021).Pure Side Conditions. In Section 4, we use two types of virtual models (countable and large non-transitive ones induced by a supercompact cardinal, which we call Magidor models) to construct our forcing with pure side conditions. The forcing covertly uses a third type of models that are transitive. We also add decorations to the conditions to add many clubs in the generic $\omega _2$. In contrast to Neeman’s method, we do not have a single chain, but $\alpha $ -chains, for an ordinal $\alpha $ with $V_\alpha \prec V_\lambda $. Thus, starting from suitable large cardinals $\kappa <\lambda $, we construct a forcing notion whose conditions are finite sets of virtual models described earlier. The forcing is strongly proper, preserves $\kappa $, and has the $\lambda $ -Knaster property. The relevant quotients of the forcing are strongly proper, which helps us prove strong guessing model principles. The construction is generalisable to a ${<}\mu $ -closed forcing, for any given cardinal $\mu $ with $\mu ^{<\mu }=\mu <\kappa $.The Iteration Theorem. In Section 5, we use the forcing with pure side conditions to iterate a subclass of proper and $\aleph _2$ -c.c. forcings and obtain a forcing axiom at the level of $\aleph _2$. The iterable class is closely related to Asperó–Mota’s forcing axiom for finitely proper forcings.Guessing Model Principles. Section 6 encompasses the main parts of the thesis. We prove the consistency of the guessing principle $\mathrm {GMP}^+(\omega _3,\omega _1)$ that states for any cardinal ${\theta \geq \omega _3}$, the set of $\aleph _2$ -sized elementary submodels M of $H(\theta )$, which are the union of an $\omega _1$ -continuous $\in $ -chain of $\omega _1$ -guessing, I.C. models is stationary in $\mathcal P_{\omega _3}(H(\theta ))$. The consistency and consequences of this principle are demonstrated in the following diagram. We also prove that one can obtain the above guessing models in a way that the $\omega _1$ -sized $\omega _1$ -guessing models remain $\omega _1$ -guessing model in any outer transitive model with the same $\omega _1$, and we denote this principle by $\rm{SGMP}^+(\omega_3,\omega_1)$.In the following diagram, $\mathrm{TP}$ stands for the tree property; $w\mathrm{KH}$ stands for the weak Kurepa Hypothesis; $\mathrm{MP}$ stands for Mitchell property, i.e., the approachability ideal is trivial modulo the nonstationary ideal; $\mathrm{AP}$ stands for the approachability property; $\mathrm {AMTP}(\kappa ^+)$ states that if $2^\kappa <\aleph _{\kappa ^+}$, then every forcing which adds a new subset of $\kappa ^+$ whose initial segments are in the ground model, collapses some cardinal $\leq 2^{\kappa }$. The dotted arrow denotes the relative consistency, while others are logical implications.Appendices. Appendix A includes merely the above diagram. Appendix B presents a proof of the Mapping Reflection Principle with finite conditions under $\mathrm {PFA}$. Appendix C contains open problems. Finally, the thesis’s bibliography consists of 42 items.Abstract prepared by Rahman MohammadpourE-mail: [email protected]: https://theses.hal.science/tel-03209264. (shrink)