Citations of:
A New Logic of Technical Malfunction
Studia Logica 101 (3):547-581 (2013)
Add citations
You must login to add citations.
|
|
A property modifier is a function that takes a property to a property. For instance, the modifier short takes the property being a Dutchman to the property being a short Dutchman. Assume that being a round peg is a property obtained by means of modification, round being the modifier and being a peg the input property. Then how are we to infer that a round peg is a peg? By means of a rule of right subsectivity. How are we to (...) No categories |
|
I present an analysis according to which the current state of the definition of substitution leads to a contradiction in the system of Transparent Intensional Logic. I entail the contradiction using only the basic definitions of TIL and standard results. I then analyse the roots of the contradiction and motivate the path I take in resolving the contradiction. I provide a new amended definition of collision-less substitution which blocks the contradiction in a non-ad hoc way. I elaborate on the consequences (...) |
|
We provide a full characterization of computational error states for information systems. The class of errors considered is general enough to include human rational processes, logical reasoning, scientific progress and data processing in some functional programming languages. The aim is to reach a full taxonomy of error states by analysing the recovery and processing of data. We conclude by presenting machine-readable checking and resolve algorithms. |
|
In this paper we investigate how inference to the best explanation works in engineering science, focussing on the context of malfunction explanation. While IBE has gotten a lot of attention in the philosophy of science literature, few, if any, philosophical work has focussed on IBE in engineering science practice. We first show that IBE in engineering science has a similar structure as IBE in other scientific domains in the sense that in both settings IBE hinges on the weighing of explanatory (...) |
|
In this paper we examine two approaches to the formal treatment of the notion of problem in the paradigm of algorithmic semantics. Namely, we will explore an approach based on Martin-Löf’s Constructive Type Theory, which can be seen as a direct continuation of Kolmogorov’s original calculus of problems, and an approach utilizing Tichý’s Transparent Intensional Logic, which can be viewed as a non-constructive attempt of interpreting Kolmogorov’s logic of problems. In the last section we propose Kolmogorov and CTT-inspired modifications to (...) |
|
Malware has been around since the 1980s and is a large and expensive security concern today, constantly growing over the past years. As our social, professional and financial lives become more digitalised, they present larger and more profitable targets for malware. The problem of classifying and preventing malware is therefore urgent, and it is complicated by the existence of several specific approaches. In this paper, we use an existing malware taxonomy to formulate a general, language independent functional description of malware (...) No categories |
|
The standard rule of single privative modification replaces privative modifiers by Boolean negation. This rule is valid, for sure, but also simplistic. If an individual a instantiates the privatively modified property (MF) then it is true that a instantiates the property of not being an F, but the rule fails to express the fact that the properties (MF) and F have something in common. We replace Boolean negation by property negation, enabling us to operate on contrary rather than contradictory properties. (...) |
|
In a 2010 paper Daley argues, contra Fodor, that several syntactically simple predicates express structured concepts. Daley develops his theory of structured concepts within Tichý’s Transparent Intensional Logic . I rectify various misconceptions of Daley’s concerning TIL. I then develop within TIL an improved theory of how structured concepts are structured and how syntactically simple predicates are related to structured concepts. |
|
|