Search results for "existential"
showing 10 items of 368 documents
The Sartre‐Heidegger Controversy on Humanism and the Concept of Man in Education
2012
Jean‐Paul Sartre claims in his 1945 lecture ‘Existentialism is a Humanism’ that there are two kinds of existentialism: that of Christians like Karl Jaspers, and atheistic like Martin Heidegger. Sartre's ‘spiritual master’ Heidegger had no problem with Sartre defining him as an atheist, but he had serious problems with Sartre's concept of humanism and existentialism. Heidegger claims that the essence of humanism lies in the essence of the human being. After the Enlightenment, the Western concept of man has been presented in education in the form of Kantian humanistic essentialism. At least in the Finnish educational system, Kantian humanism is almost an official ideological background of all…
Il danno da perdita dell'animale di affezione e le nuove frontiere del danno esistenziale
2023
Il saggio propone una riflessione sulla discussa fattispecie del danno da perdita dell’animale di affezione e sulle nuove frontiere del danno esistenziale, riconfigurato in termini di danno evento. La riflessione, alla luce delle nuove prospettive di tutela degli animali quali esseri sensienti, è suggerita dal nuovo articolo 13 del Trattato UE e dal recente inserimento della protezione degli animali nel nuovo testo dell’art. 9 della Costituzione. Nel caso del danno da perdita dell’animale di affezione, la violazione del diritto della persona viene riconosciuta attraverso una rilettura dell’art. 2 della Costituzione, sganciata dal vincolo formale di una previsione esplicita ed aperta all’ ev…
A characterization of the n-ary many-sorted closure operators and a many-sorted Tarski irredundant basis theorem
2018
A theorem of single-sorted algebra states that, for a closure space (A, J ) and a natural number n, the closure operator J on the set A is n-ary if and only if there exists a single-sorted signature Σ and a Σ-algebra A such that every operation of A is of an arity ≤ n and J = SgA, where SgA is the subalgebra generating operator on A determined by A. On the other hand, a theorem of Tarski asserts that if J is an n-ary closure operator on a set A with n ≥ 2, then, for every i, j ∈ IrB(A, J ), where IrB(A, J ) is the set of all natural numbers which have the property of being the cardinality of an irredundant basis (≡ minimal generating set) of A with respect to J , if i < j and {i + 1, . . . …
Entropy-Based Behavioural Efficiency of the Financial Market
2021
The most known and used abstract model of the financial market is based on the concept of the informational efficiency (EMH) of that market. The paper proposes an alternative which could be named the behavioural efficiency of the financial market, which is based on the behavioural entropy instead of the informational entropy. More specifically, the paper supports the idea that, in the financial market, the only measure (if any) of the entropy is the available behaviours indicated by the implicit information. Therefore, the behavioural entropy is linked to the concept of behavioural efficiency. The paper argues that, in fact, in the financial markets, there is not a (real) informational effi…
Probabilistic and team PFIN-type learning: General properties
2008
We consider the probability hierarchy for Popperian FINite learning and study the general properties of this hierarchy. We prove that the probability hierarchy is decidable, i.e. there exists an algorithm that receives p_1 and p_2 and answers whether PFIN-type learning with the probability of success p_1 is equivalent to PFIN-type learning with the probability of success p_2. To prove our result, we analyze the topological structure of the probability hierarchy. We prove that it is well-ordered in descending ordering and order-equivalent to ordinal epsilon_0. This shows that the structure of the hierarchy is very complicated. Using similar methods, we also prove that, for PFIN-type learning…
On the Power of Non-adaptive Learning Graphs
2012
We introduce a notion of the quantum query complexity of a certificate structure. This is a formalisation of a well-known observation that many quantum query algorithms only require the knowledge of the disposition of possible certificates in the input string, not the precise values therein. Next, we derive a dual formulation of the complexity of a non-adaptive learning graph, and use it to show that non-adaptive learning graphs are tight for all certificate structures. By this, we mean that there exists a function possessing the certificate structure and such that a learning graph gives an optimal quantum query algorithm for it. For a special case of certificate structures generated by cer…
Parity Oblivious d-Level Random Access Codes and Class of Noncontextuality Inequalities
2016
One of the fundamental results in quantum foundations is the Kochen-Specker no-go theorem. For the quantum theory, the no-go theorem excludes the possibility of a class of hidden variable models where value attribution is context independent. Recently, the notion of contextuality has been generalized for different operational procedures and it has been shown that preparation contextuality of mixed quantum states can be a useful resource in an information-processing task called parity-oblivious multiplexing. Here, we introduce a new class of information processing tasks, namely d-level parity oblivious random access codes and obtain bounds on the success probabilities of performing such task…
Jaspers’ Concept of Philosophical Faith: A New Synthesis?
2011
Philosophy begins where science ends. Philosophy has ceased to be a science. It is a source of its own. The limits of science make obvious that faith belongs to being human. Faith is either religious or philosophical. Faith is a main phenomenon of being human. It consists in the simple fact that persons have ultimate convictions. Philosophical faith is existential faith. Its certainty is tied to the individual. Philosophical faith cannot be achieved without personal effort, without acts of actual freedom, and without realizations of Existenz. Jaspers’ concept of philosophical faith turns out to be a new synthesis of historical conditions and philosophical requirements.
A short proof of the self-improving regularity of quasiregular mappings
2005
. The theoryof quasiregular mappings is a central topic in modern analysis withimportant connections to a variety of topics as elliptic partial differen-tial equations, complex dynamics, differential geometry and calculus ofvariations [13] [10].A remarkable feature of quasiregular mappings is the self-improvingregularity. In 1957 [2], Bojarski proved that for planar quasiregularmappings, there exists an exponent
Misconceptions and Ambiguities in VET: Do We Speak the Same Language?
2021
This chapter reviews some of the most extended notions used in the field of VET. Historical and comparative analysis of education run the risk to use commonplaces without proper understanding of the nuances, difficult to translate but which give different meaning to the same words. In particular, I explain these notions and their meaning and context to show the contrast among countries with different VET traditions. The main challenge is probably to consider current and historical differences between a school-based vocational education system and those where apprenticeships have been the mainstream. Academic work needs to be accurate and avoid quick and careless translation, and even manipu…