Jekyll2020-07-10T14:47:03+00:00https://asamonek.github.io/feed.xmlAleksandra SamonekAleksandra SamonekLet’s Phi! Online conference about non-academic career opportunities for philosophers on July 11, 20202020-07-10T00:00:00+00:002020-07-10T00:00:00+00:00https://asamonek.github.io/events/2020/07/10/lets-phi<p>Together with <a href="http://www.letsphi.com/">Let’s Phi!</a> we are kicking off a free online event dedicated to philosophy students interested in following non-academic career paths after graduation and we address the information gap which prevents philosophy graduates from making full use of their position at the job market.</p>
<p>We are offering over 3 hours of workshops and talks with academics, recruiters and professionals from tech, law, IT, consulting and more.</p>
<p>During the meeting we will be testing <a href="https://knit.works/">Knit - The Group Video Call</a> which helps you engage meaningfully in the social interactions online. Aside from the workshops and talks by philosophers working in different industries, Knit facilitates a number of fireside chats, where you can easily talk to other participants and a bar space, where you can mingle and meet everyone. Wear your best shirt and get your webcam ready!</p>
<p>You can find the full program here: <a href="https://knit.works/letsphi-home/">https://knit.works/letsphi-home/</a></p>
<p>Event page on facebook: <a href="https://www.facebook.com/events/3026195867500991/">https://www.facebook.com/events/3026195867500991/</a></p>
<h3 id="venue-and-time">Venue and time</h3>
<p>16:00 - 21:00 BST, July 11, 2020 <br />
Online at: <a href="https://knit.works/letsphi-home/">https://knit.works/letsphi-home/</a></p>Aleksandra SamonekTogether with Let’s Phi! we are kicking off a free online event dedicated to philosophy students interested in following non-academic career paths after graduation and we address the information gap which prevents philosophy graduates from making full use of their position at the job market.Introduction to Complex Predicate Calculus for Databases2019-12-13T00:00:00+00:002019-12-13T00:00:00+00:00https://asamonek.github.io/events/2019/12/13/introduction-cpc-talk<p>On December 19, 2019, <a href="https://www.researchgate.net/profile/Olga_Poller">Olga Poller</a> and me will give a talk about our joint research at the Departamental Seminar of the <a href="https://filozofia.uj.edu.pl/en_GB/department-of-logical-rethorics">Section of Logical Rhetoric</a>.</p>
<h3 id="venue-and-time">Venue and time</h3>
<p>17:30 - 19:00 <br />
Room 28, I floor, Collegium Broscianum <br />
Institute of Philosophy, Jagiellonian University<br />
ul. Grodzka 52, Kraków, Poland</p>
<h3 id="introduction-to-complex-predicate-calculus-for-databases">Introduction to Complex Predicate Calculus for databases</h3>
<p>CPC (Complex Predicate Calculus) represents the process of creating complex predicates in the natural language in a such a way that the result of this process (which we will call a <em>query</em>) constitutes information included in a database. Initially, CPC was designed to represent prepositions, but it soon turned out that the rules of CPC can be applied much more universally, to a much wider class of phrases. The goal of this talk is to introduce the philosophical motivation behind CPC and also its theoretical foundations, such as the language, syntax and the CPC model. We will also discuss some preliminary results concerning compositionality and the rules of CPC.</p>
<h3 id="pl-wprowadzenie-do-rachunku-złożonych-predykatów-dla-baz-danych">(PL) Wprowadzenie do rachunku złożonych predykatów dla baz danych</h3>
<p>Rachunek złożonych predykatów CPC (Complex Predicate Calculus) pozwala na reprezentację procesu tworzenia złożonych predykatów w języku naturalnym w taki sposób, że wynik tego procesu można zapisać w postaci bazy danych. W pierwotnym założeniu CPC miał służyć do reprezentacji wyrażeń przyimkowych, jednak wkrótce okazało się, że reguły CPC pozwalają na reprezentację o wiele szerszej klasy wyrażeń. Celem tego wystąpienia będzie przestawienie motywacji filozoficznej oraz podstaw teoretycznych CPC, w szczególności podstawowych definicji, takich jak język, zasady syntaktyczne oraz model CPC. Przedstawimy także wstępne wyniki dotyczące kompozycjonalności oraz reguł CPC.</p>Aleksandra SamonekOn December 19, 2019, Olga Poller and me will give a talk about our joint research at the Departamental Seminar of the Section of Logical Rhetoric.Can intended models of mathematical theories change over time? Work In Progress talk at UCLouvain on October 16, 20192019-10-11T00:00:00+00:002019-10-11T00:00:00+00:00https://asamonek.github.io/events/2019/10/11/wip-seminar<p>On October 16, 2019, <a href="https://cris.vub.be/en/persons/colin-jakob-rittberg(b0bc2ff1-4b71-47a2-941b-bd97d9cf4144).html">Colin Rittberg</a> and myself will give a joint talk about our upcoming paper on intended models in mathematical practice at the Work In Progress seminar of the CEFISES at UCLouvain, Louvain-la-Neuve. The seminar is open and all interested are invited to join.</p>
<h3 id="venue-and-time">Venue and time</h3>
<p>15:00 - 17:00 <br />
Salle Ladrière (a.124 - 1st floor), Collège Mercier <br />
Place du Cardinal Mercier, Louvain-la-Neuve, Belgium</p>
<h3 id="can-intended-models-of-mathematical-theories-change-over-time">Can intended models of mathematical theories change over time?</h3>
<p>The work of philosophers of mathematical practice has challenged our understanding of various concepts in mathematics. For example, observing how mathematical proofs develop over time and how they relate to our understanding of mathematical objects and phenomena, led Hanna (1989, 2002); Mancosu (2008); Macbeth (2012); Van Bendegem (2014) and others, to a conclusion that the adequate description of the notion of mathematical proof relies on processes that are much more complex than syntactic constructs and manipulations. In our paper we challenge another concept which has been highly idealised in classical philosophy of mathematics, namely the concept of an intended model. We will contest the widely accepted understanding of an intended model as simply one guaranteed to be found among all the models of a theory.</p>
<p>We will discuss the notion of the intended model in the context of the distinction between what we call <em>content-driven practices</em> and <em>content-creating practices</em>, borrowing from Lakatos’ notion of the informal (<em>inhaltliche</em>) mathematics (<em>cf.</em> Krause and Arenhart (2016, p. 63)). Content-driven mathematical practices aim to explicate in terms of a mathematical theory some content or structure, or the so-called <em>intended model</em>, which is assumed to be given in advance: content first, theory later. We intentionally use the term <em>mathematical theory</em> instead of <em>axiomatic theory</em>, as we aim highlight the order in which mathematical concepts emerge. For example, number theory had featured an intended model of natural numbers long before the development of PA. Another case is geometry trying to capture the realities of space.</p>
<p>In content-creating mathematical practices no such content is given in advance. Instead, an axiomatic theory defines a class of structures, its own object of study. The order is reversed compared to content-creating practices, that is we obtain theory first and content later. Classic examples of content-creating practices include algebra and graph theory, where the axiomatic theory is not meant to explicate any intended structure, but rather serves as a starting point of the process of discovering a class of structures which are presumed to be of mathematical interest.</p>
<p>Assuming that some mathematical practices are content-driven, where does their content come from? A plausible answer to this question has been proposed by Ferreirós, namely the content of mathematical theories arises from the historical development of “technical practices” (Ferreirós, 2016, p.40). We will supplement Ferreirós’ case with an example from contemporary set theory, where in the current axiom selection debate, the theory has caught up to the content in ways that require (and have produced) new ways of understanding the intended model of set theory. Our principal case study to show this is H. Woodin’s Ultimate L argument (Woodin, 2017). We will also touch upon other proposals by Steel and Magidor.</p>
<p>We will further argue that the understanding of an intended model for a given discipline of mathematics has the potential to change over time and even erode, so that the practice no longer aims at explicating an intended model at all. In this, within the same mathematical theory we can observe a shift from content-driven to content-creating practice. Starting with von Neumann, we will introduce the notion of epistemic pluralism and touch upon Väänänen’s work to formalise the notion. Epistemic pluralism already erodes, but does not discard, the idea of an intended model for a content-driven practice. We then report on how Hamkins shifts pluralism from the epistemic to metaphysical. We argue that with this shift, Hamkins places theory before content in the sense of our paper, and thereby suggests to transform set theory from a content-driven to a content-creating practice.</p>Aleksandra SamonekOn October 16, 2019, Colin Rittberg and myself will give a joint talk about our upcoming paper on intended models in mathematical practice at the Work In Progress seminar of the CEFISES at UCLouvain, Louvain-la-Neuve. The seminar is open and all interested are invited to join.Fighting Fake News: our winning project at Hack Belgium 20192019-03-30T00:00:00+00:002019-03-30T00:00:00+00:00https://asamonek.github.io/programming/2019/03/30/hack-belgium-2019<p>Last weekend (March 28 - 30, 2019) our team took first place at <a href="https://www.hackbelgium.be">Hack Belgium 2019</a> in the <em>Credible, Engaging Media</em> category (<em>Creating new experiences and new sources of trust</em>).<br />
We were especially interested in the problem of <a href="https://www.hackbelgium.be/experiencing-true-media/">creating smarter media consumers</a>.</p>
<p>Our app, called <em>Jamnik</em>, adds a “credibility layer” to links shared in feeds and private conversations on Facebook, Twitter, WhatsApp, <em>etc.</em>, by visualising the level of reliability of the news source in the link preview and under a thumbnail of a published link. The analysis of credibility focuses on targeting automatically generated content, forged images and videos, and sources related to known fake news generators.</p>
<p>Our priorities were neutrality, transparency of the evaluation process and user-friendliness, including intuitive representation of the evaluation, fast delivery and eliminating the need of case-by-case evaluation assistance from the user. You can read the upshot of our idea in <a href="https://prezi.com/p/ybpjfpb7guto/hack-belgium-2019/">the presentation delivered during Hack Belgium 2019</a>.</p>
<p><img src="https://raw.githubusercontent.com/asamonek/asamonek.github.io/master/images/2019-03-30-hbteam.jpg" alt="Our team" title="Our team" /></p>
<p>I would like to thank the members of my team, <a href="https://www.linkedin.com/in/danny-moeuthwil-057417100/">Danny Moeuthwil</a>, <a href="https://www.linkedin.com/in/ben-bornemann-b5898377/">Ben Bornemann</a>, <a href="https://www.linkedin.com/in/gaetan-henry-8ba778132/">Gaetan Henry</a>, <a href="https://www.linkedin.com/in/stephanie-michaux/">Stéphanie Michaux</a> and <a href="https://www.linkedin.com/in/abali-essende-59355129/">Abali Essende</a>, for the three days of fruitful work and excellent company.<br />
I also thank our mentors and workshop facilitators, particularly <a href="https://twitter.com/florisdaelemans">Floris Daelemans</a> of VRT for his invaluable feedback during critical moments of the project development.</p>
<p>Stay tuned for news about project <em>Jamnik</em>!</p>Aleksandra SamonekLast weekend (March 28 - 30, 2019) our team took first place at Hack Belgium 2019 in the Credible, Engaging Media category (Creating new experiences and new sources of trust). We were especially interested in the problem of creating smarter media consumers.[Extended deadline] CfP ExLog 2019: Explaining explanation using new developments in logic and formal semantics (UCLouvain, 6-8 May 2019)2019-03-13T00:00:00+00:002019-03-13T00:00:00+00:00https://asamonek.github.io/events/2019/03/13/cfp-exlog<p>On 6-8 May 2019 we are organising a conference at UCLouvain in Louvain-la-Neuve, Belgium. The full topic of the conference is the following: <em>Explaining explanation using new developments in logic and formal semantics. Hyperintensionality, relevance, counterfactuals, grounding and truth-maker semantics</em>. You can find more information about the scope on <a href="https://sites.google.com/view/exlog2019">the conference website</a>.</p>
<p>The list of invited speakers includes Hannes Leitgeb, Francesca Poggiolesi, Friederike Moltmann, Raymundo Morado, Joke Meheus, Kit Fine and J. Michael Dunn.</p>
<p><a href="https://easychair.org/conferences/?conf=exlog2019">Go directly to the submission page.</a></p>
<p>Currently the deadline for submissions is <strong>23 March 2019</strong>.</p>Aleksandra SamonekOn 6-8 May 2019 we are organising a conference at UCLouvain in Louvain-la-Neuve, Belgium. The full topic of the conference is the following: Explaining explanation using new developments in logic and formal semantics. Hyperintensionality, relevance, counterfactuals, grounding and truth-maker semantics. You can find more information about the scope on the conference website.Hypothetical Reasoning. From Formal Learning Theory to Machine Learning2017-03-01T00:00:00+00:002017-03-01T00:00:00+00:00https://asamonek.github.io/2017/03/01/conditionals<p>The preliminary title of my doctoral dissertation is <em>Hypothetical Reasoning. From Formal Learning Theory to Machine Learning</em>. My research is embedded in a broader project conducted by <a href="https://www.researchgate.net/profile/Peter_Verdee">Peter Verdée</a> entitled <em>Relevance criteria in entailment, epistemic grounding and counterfactuals: semantic and linguistic aspects</em>. The project is funded by Fonds Spécial de Recherche (FSR) and started on March 1, 2017.</p>
<p>The goal of my doctoral thesis is to obtain an interpretation of certain conditional sentences of the natural language in terms of <a href="https://link.springer.com/referenceworkentry/10.1007%2F978-1-4419-1428-6_444">formal learning theory</a>; and more specifically, conditional sentences which correspond to various forms of hypothetical reasoning. This problem relates to an analogous program of interpreting conditional sentences in machine learning, in particular to the issue of opinion mining and feature- or topic-based sentiment analysis (see <a href="http://www.aclweb.org/anthology/D09-1019">Narayanan, Liu and Choudhary (2009)</a> for an example of how to use conditional analysis to assign positive, neutral or negative sentiments to topics or product features).</p>
<p>An additional objective of my work is to ensure that the obtained interpretation satisfies certain relevance and explainability criteria, which in machine learning correspond to the problem of black box interpretability. The following two aspects of my dissertation are particularly relevant:</p>
<ol>
<li>the interpretation of the process of hypothetical reasoning which I propose can be applied uniformly to human and machine learners, and</li>
<li>the probabilistic framework I use allows for producing explanations of all related processes, contributing to increased interpretability of certain machine learning models.</li>
</ol>Aleksandra SamonekThe preliminary title of my doctoral dissertation is Hypothetical Reasoning. From Formal Learning Theory to Machine Learning. My research is embedded in a broader project conducted by Peter Verdée entitled Relevance criteria in entailment, epistemic grounding and counterfactuals: semantic and linguistic aspects. The project is funded by Fonds Spécial de Recherche (FSR) and started on March 1, 2017.