Interpreting Non-English Administrative Acts with Boolean Algebra

Click For Summary

Discussion Overview

The discussion revolves around the interpretation of a non-English administrative act using Boolean algebra. Participants explore how to analyze a specific paragraph that defines a "new car" based on three conditions, each framed as negative statements. The focus is on the logical implications of these conditions and their interpretation within the context of Boolean logic.

Discussion Character

  • Exploratory
  • Technical explanation
  • Debate/contested

Main Points Raised

  • One participant questions whether all three conditions must be satisfied for a vehicle to be considered a "new car," or if meeting just one is sufficient.
  • Another participant presents a Boolean representation of the conditions, suggesting that only one condition needs to be true for the vehicle to be classified as new.
  • A different participant discusses the implications of Boolean arithmetic, asserting that the negative statements can still lead to a true conclusion about the vehicle's status as new.
  • One participant expresses gratitude for the discussion and elaborates on the complexity of interpreting the administrative act, noting the oddity of the definition of "new" based on the conditions provided.
  • Another participant clarifies that negative statements are propositions that can be true or false, emphasizing the importance of understanding the logical structure rather than assuming negativity implies falsehood.

Areas of Agreement / Disagreement

Participants do not reach a consensus on the interpretation of the conditions. Multiple competing views remain regarding how to apply Boolean logic to the definitions provided in the administrative act.

Contextual Notes

Participants note the complexity of the definitions and the potential for misinterpretation due to the negative framing of the conditions. There is an acknowledgment that the administrative act's wording may lead to confusion in logical interpretation.

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.
 

Similar threads

  • · Replies 376 ·
13
Replies
376
Views
25K
Replies
22
Views
2K
  • · Replies 1 ·
Replies
1
Views
921
  • · Replies 26 ·
Replies
26
Views
6K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 37 ·
2
Replies
37
Views
6K
  • · Replies 31 ·
2
Replies
31
Views
4K
  • · Replies 47 ·
2
Replies
47
Views
6K
  • · Replies 25 ·
Replies
25
Views
6K
  • · Replies 3 ·
Replies
3
Views
2K