Interpreting Non-English Administrative Acts with Boolean Algebra

Mnyx
Messages
2
Reaction score
0
Hello all

I don't write much, I mainly follow you silently. Great forum
I have a doubt that to many of you will seem absolutely silly but it has been bugging me for days.

I am trying to find the correct interpretation to a non-english administrative act and trying to use all possible angles

The question is

How do I interpret this paragraph using boolean algebra?

PARAGRAPH:

It shall be deemed a “new car”, a vehicle that:

Has never been out of the factory

Or

Has never been registered with motorization

Or

Doesn’t have any scratches

END OF PARAGRAPH

Would you interpret that all three conditions need to be satisfied for the vehicle to be a “new car” because they are negative statements or that only one of the three conditions needs to be met?


I was wondering if you guys could give me your thoughts on this?
thanks
 
Physics news on Phys.org
Hello, here's my take on this:

Let

of : Has been out of the factory
m : Has been registered with motorization
s : has scratches

then

!of v !m v !s

Where v is or and ! is not.

Only one of these conditions has to be met to satisfy that it is a true statement.

Truth table, look at the before last column to get the result


F | M | S | !F v !M *v* !S
---+---+---+--------------
0) T | T | T | F F F *F* F
1) T | T | F | F F F *T* T
2) T | F | T | F T T *T* F
3) T | F | F | F T T *T* T
4) F | T | T | T T F *T* F
5) F | T | F | T T F *T* T
6) F | F | T | T T T *T* F
7) F | F | F | T T T *T* T

Therefore if F,M or S is true, it's not a new car.
 
Mnyx said:
The question is

How do I interpret this paragraph using boolean algebra?

PARAGRAPH:

It shall be deemed a “new car”, a vehicle that:

Has never been out of the factory

Or

Has never been registered with motorization

Or

Doesn’t have any scratches

In Boolean arithmetic: 1+1=1, 1+0=1, 0+1=1, 0+0=0.

Although the statements are negative, the proper interpretation IMO is that if the statement is affirmed it should be assigned the Boolean value of 1, and 0 if it is not affirmed.

So "It is true that the car has no scratches, therefore the car is new". (Idiotic, but logically follows from the premise). If this were the only affirmed statement, we have 0+0+1=1, where the conclusion "The car is new" is affirmed.
 
Last edited:
I can't thank you enough for helping me think this through

I am still trying to figure this out

Just to explain a bit better. Some of the statements seem idiotic because I oversimplified the wording and changed the subject matter a bit.
However, I was faithful to the spirit of the administrative act I am trying to decipher, where "new" is defined in relation to three negative statements that go from a first one that is almost impossible to meet to a third one that is satisfied by an abnormally large number of cases (and on its own represents a very odd definition of "new")
 
Mnyx said:
I can't thank you enough for helping me think this through

I am still trying to figure this out

Just to explain a bit better. Some of the statements seem idiotic because I oversimplified the wording and changed the subject matter a bit.
However, I was faithful to the spirit of the administrative act I am trying to decipher, where "new" is defined in relation to three negative statements that go from a first one that is almost impossible to meet to a third one that is satisfied by an abnormally large number of cases (and on its own represents a very odd definition of "new")

Your welcome. I thought this was just an example and you were interested in using Boolean logic to reach a conclusion. Your confusion seems to be in thinking that so called "negative" statements must somehow be false. They are just propositions which can be true or false. "I am not the King of Spain" is a proposition. It is true. There is no necessity to convert the statement to "I am the King of Spain" and declare it false. They both mean exactly the same thing. The key point here in terms of logic is the interpretation of the OR connective.
 
Namaste & G'day Postulate: A strongly-knit team wins on average over a less knit one Fundamentals: - Two teams face off with 4 players each - A polo team consists of players that each have assigned to them a measure of their ability (called a "Handicap" - 10 is highest, -2 lowest) I attempted to measure close-knitness of a team in terms of standard deviation (SD) of handicaps of the players. Failure: It turns out that, more often than, a team with a higher SD wins. In my language, that...
Hi all, I've been a roulette player for more than 10 years (although I took time off here and there) and it's only now that I'm trying to understand the physics of the game. Basically my strategy in roulette is to divide the wheel roughly into two halves (let's call them A and B). My theory is that in roulette there will invariably be variance. In other words, if A comes up 5 times in a row, B will be due to come up soon. However I have been proven wrong many times, and I have seen some...

Similar threads

Replies
3
Views
3K
Replies
3
Views
2K
Replies
3
Views
3K
Replies
9
Views
3K
Replies
20
Views
4K
Replies
21
Views
3K
Replies
3
Views
2K
Back
Top