Results 71 to 80 of about 481 (199)
ABSTRACT Descartes' cogito argument is perhaps the most well‐known philosophical argument, the conclusion of which is supposed to be a form of rationalism that allows for contingent a priori knowledge of the world. In this short note, I argue that, in fact, the all important statement, ‘I am, I exist’, should be analysed through the lens of (classical)
Tom Schoonen
wiley +1 more source
C Program Verication in the Multilanguage System Spectrum
This paper presents the expendable multi-language analysis and verication system SPECTRUM, which is being developed within the framework of the project SPEC- TRUM. The project prospects are discussed using the example of C program verication. The project
V. A. Nepomniashy +5 more
doaj
A Machine Proof of the Filter-Method Construction for Real Numbers
This paper presents a machine verification of a real number theory where real numbers are constructed using concepts related to filters. The theory encompasses a special filter, namely the non-principal arithmetical ultrafilter whose existence can be ...
Guowei Dou, Wensheng Yu
doaj +1 more source
Political Fictionality: Vladislav Surkov and the Rise of the Authorial State
Abstract This article introduces the concept of political fictionality as a theoretical framework for analyzing the convergence of literary authorship and political power in Russia during the Putin era, using Vladislav Surkov—a longtime presidential advisor and ideologue as well as fiction writer under the pseudonym Natan Dubovitskii—as its principal ...
Ekaterina Vassilieva
wiley +1 more source
Axiomatic Foundations of Acceptability Semantics.
An argument is a reason or justification of a claim. It has an intrinsic strength and may be attacked by other arguments. Hence, the evaluation of its overall strength becomes mandatory, especially for judging the reliability of its claim. Such an evaluation is done by acceptability semantics.
Amgoud, Leila, Ben-Naim, Jonathan
openaire +2 more sources
Sound and Complete Axiomatization of Trace Semantics for Probabilistic Systems
AbstractWe present a sound and complete axiomatization of finite complete trace semantics for generative probabilistic transition systems. Our approach is coalgebraic, which opens the door to axiomatize other types of systems. In order to prove soundness and completeness, we employ determinization and show that coalgebraic traces can be recovered via ...
A.M. Silva (Alexandra), A. Sokolova
openaire +2 more sources
Theatres of Indirectness: Passive Aggression and Failure
Critical Quarterly, EarlyView.
Sara Crangle, Sam Ladkin
wiley +1 more source
Abstract This paper argues for the significance of Kaplan's logic LD in two ways: first, by looking at how logic got along before we had LD, and second, by using it to bring out the similarity between David Hume's thesis that one cannot deduce claims about the future on the basis of premises only about the past, and the so‐called "essentiality" of the ...
Gillian Russell
wiley +1 more source
Promising Compilation to ARMv8.3
Concurrent programs have behaviors, which cannot be explained by interleaving execution of their threads on a single processing unit due to optimizations, which are performed by modern compilers and CPUs.
A. V. Podkopaev, O. Lahav, V. Vafeiadis
doaj +1 more source

