что нового: Difference between revisions

From Lojban
Jump to navigation Jump to search
mNo edit summary
m (Text replace - "Old Pages: " to "jbocre: ")
Line 1: Line 1:


''For an explanation of the notation used in this article, see the explanation folllowing "(work in progress)".''
{ANAME()}21Aug2006{ANAME}


----
== 21 августа 2006 ==


Ok, this is what I propose for a trivalent system of
saxaras, первый ложбанско-русско-ложбанский электронный словарь, готов! Скачать его Вы сможете на его страничке: [[jbocre: saxaras|saxaras]]


unary operators in lojban:
{ANAME()}20Jul2006{ANAME}


cai = (1,-1,-1)
== 20 июля 2006 ==


sai = (1,0,0)
Вы когда-нибудь были в стране,где говорят на Ложбане? Такая страна называется samxarmuj, что значит "компьютеризованная воображаемая вселенная". Это текстовый виртуальный мир, где вы можете управлять героем, отдавая команды на английском или на Ложбане. Ложбан в мире samxarmuj действует как язык магии: он позволяет творить объекты и наделять их формой и функциями.


ru'e = (1,1,-1)
И при этом вам даже не понадобится билет на самолет: [http://teddyb.org/cgi-bin/moo_ssh.html �ликните сюда] и введите гостевой пароль "moo" (пока вы не заведете свой эккаунт). Команды печатаются в нижней части окна. Гостевые эккаунты могут использовать только английский. Чтобы завести свой эккаунт, напечатайте команду "register".  Регистрация совершенно бесплатна.


cu'i = (0,1,-1)
Дополнительная информация, включая другие способы доступа к samxarmuj, имеется на странице [[jbocre: The Lojban MOO|The Lojban MOO]].


nai = (-1,0,1)
Напряженным трудом множества квалифицированных программистов нашего сообщества создана одна из самых привлекательных площадок, где можно пользоваться Ложбаном, за всю историю этого языка. Сегодня проект покидает бета-фазу испытательного периода. С трепетом душевным мы выпускаем в свет эту массовую многопользовательскую систему и объявляем ее открытой для всех. Но теперь нам нужно множество персонажей, чтобы заселить этот мир.


I think {cai}, {ru'e} and {nai} are the easiest to accept.
Мы бросаем клич новым магам любого уровня мастерства. Придите и начните обустраивать свой участок этой земли. Хотя для того, чтобы искать приключений в стране, которая появляется из небытия вокруг вас, не нужно знать Ложбан, все магические заклинания должны произноситься только на правильном Ложбане. Сила, внемлющая нашим речениям в [[jbocre: samxarmuj|samxarmuj]] и претворяющая их в плоть, не поймет никакого другого языка.


(-1,0,1) is the most obvious generalization of {nai} from
Новая страна приглашает и туристов, которые совсем не знакомы с Ложбаном.  Не стесняйтесь задавать нам любые вопросы про то, как пользоваться системой. При достаточном интересе, мы, кто знает, смогли бы даже учредить что-то вроде Хогвартской академии для начинающих ложбанских магов! Добро пожаловать в [[jbocre: samxarmuj|samxarmuj]]! Будьте как дома!


binary. (1,-1,-1) corresponds to the strongest assertion
{ANAME()}4May2006{ANAME}


(certainty or necessity, depending on what system we use
== 4 мая 2006 ==


it on) so it has to be {cai}. (1,1,-1) is possibility or
Праздник логического языка [[jbocre: jbonunsla 2006]] состоялся на конвенте [http://www.penguicon.org/ enguicon] в Мичигане 21-23 апреля 2006. Следующий праздник будет на конвенте [http://www.philcon.org/2006/ hilcon 2006] в ноябре!


a weak assertion, so I think {ru'e} fits well.
{ANAME()}24Mar2006{ANAME}


Now, (1,0,0) is also an assertion, but not as strong
== 24 марта 2006 ==


as certainty, something like "this is how it is, but I
[[jbocre: jbonunsla 2006]], праздник логического языка, состоится на конвенте научной фантастике и выставке свободного программного обеспечения


give no guarantees". I think {sai} can work for that.
[http://www.penguicon.org/ enguicon] в Мичигане, 21-23 апреля 2006. Это не исключает возможности других ложбанских фестивалей в 2006 году.


And finally, {cu'i} is for neutral. (0,1,-1) is not
{ANAME()}4Jan2006{ANAME}


absolutely neutral, it is uncertainty with a bent towards
== 4 января 2006 ==


assertion, but it is the closest to neutral and we do need
[[jbocre: Logfest|Logfest]] (ежегодный сбор LLG) был проведен на конвенте  PhilCon в Филадельфии с 9 по 11 декабря. Мероприятие оказалось вполне успешным, несмотря на то что участников приехало меньше, чем ожидалось. Подробности на странице [[jbocre: Logfest 2005]].


it to generate others, so {cu'i} has to be it.
{ANAME()}13Nov2005{ANAME}


With those 5 it is possible to generate all 27 unary
== 13 ноября 2005 ==


operators, with at most three of them. For example,
Как секретарь, приношу свои извинения за запоздалость этого объявления, но полное подтверждение


(0,0,1) is {naisai}, (-1,1,-1) is {cu'icai}, (0,0,0)
я получил всего лишь 10 дней назад.


is {sairu'ecu'i}  (among several possibilities), etc.
[http://www.philcon.org/2005/ hilcon - Филадельфийская конференция нучной фантастики и фэнтези] согласилась предоставить зал для LogFest 2005!


Only 8 of the 27 need three basic functions, the rest
Philcon 2005 проводится в гостинице Philadelphia Marriott Downtown


can be formed from just two.
9 - 11 декабря 2005. Это '''ЧЕРЕЗ 26 ДНЕЙ'''!


The nice thing about this system is that it can be used
Я понимаю, что это слишком короткое объявление, но если мы сможем собрать


for different things. For example, for a strictly logical
достаточное количество людей, то зал нам предоставят и в следующем году, и


system we just attach them to {ja'a}, using {ja'acai},
(хотелось бы) эти отношения будут продолжаться и дальше.


{ja'acu'inai}, etc. And {na}={ja'anai}, so some of them
People showing up for LogFest '''will''' have to buy PhilCon


can be shortened.
memberships. Please let me know if that, or any other aspect of


But they can also be used for evidentials, attaching them
these arrangements, provides an unacceptable financial burden to


to {ju'a} for example. Then again there might be some
you.  I, and others, are willing to help put up some money for


shortcuts, like {ju'acai} might be {za'a} and {ju'asairu'e}
active Lojbanists who want to come.


might be {ca'e}, etc, but we know that we can get all
We don't know how big the room is going to be yet, but I've told


27 of them from just the simplest, which is always (1,0,-1)
them we expect about 10 people.


and doesn't take any modifier. We can use {la'a} as the
{ANAME()}5Sep2005{ANAME}


basis for the probability set, etc.
== 5 Sep 2005 ==


Would that work?
'''Complete site overhaul!'''  Most of the lojban.org content has been


co'o mi'e [[User:xorxes|xorxes]]
moved from a set of static HTML pages to a


The three assertions:
[http://www.tikiwiki.org/ ikiWiki] content management system.  The


cai = (1,-1,-1) = necessarily
number of changes caused by this are too long to list.  In addition,


sai = (1,0,0)  = probably
the [[jbocre: LLG 2004 Annual Meeting Minutes]] have been posted.


ru'e = (1,1,-1) = possibly
{ANAME()}2May2004{ANAME}


are the three that differ minimally from the simple
== 2 May 2004 ==


assertion (1,0,-1).
A variety of minor bug fixes were done on the site, as well as some


(work in progress)
more major items.  The front page was returned to CSS, XHTML and


----
Bobby Level 3 compliance.  The problem with clicking on one of the


''I don't get it. What are your axes?''
maps causing the maps to stop functioning was fixed. A couple of


This proposal is from [http://groups.yahoo.com/group/lojban/message/3218  discussion of trivalent logic in the summer of 2000]. See also [http://www.aymara.org he Aymara Language] and [http://www.aymara.org/biblio/igr/igr.html he paper describing Aymara suffixes in terms of trivalent logic].  A detailed description of trivalent logic begins at the section labeled "4.1" in [http://www.aymara.org/biblio/igr/igr4.html hapter IV: The Logical Suffixes of the Aymara Language] of that paper.
one-sheet brochures were added to [http://www.lojban.org/publications/brochures.html the


In brief, trivalent logic uses, in addition to the standard two truth values of TRUE and FALSE, a third value (neither true nor false, both true and false, etc.), which might be called ''ina'', after the Aymara, or ''[[jbocre: norje'u|norje'u]]'' in Lojban. True is represented by 1, norje'u by 0, and false by -1.  The notation P = (p1, p2, p3) for a unary operator P means that P(1) =
brochures page].  The 25 November 2002 Board Meeting minutes were


p1, P(0) = p2, P(-1) = p3It relates the truth value (one of 1, 0, or -1) of an operand to the truth value of a claim (P, in this case) about the operand.  p1 represents the truth of P(x) when x is known to be true (1).  p2 represents the truth value of P(x) when x is known to be neither-true-nor-false (0, or ''ina'').  p3 represents the truth value of P(x) if x is known to be false (-1).
addedThe 2003 annual meeting minutes were added.


The following truth tables are the return value for true, norje'u, and false, in that order. (The plus in parentheses means that it is plausible (for example) that the statement is true, and the minus, that it is plausible that the statement is false. The glosses are an elaboration of the glosses presented in the above paper.)
{ANAME()}10Sep2003{ANAME}


|| (1, 1, 1) |tautology |sairu'e
== 10 September 2003 ==


(1, 1, 0) |plausibility (+)/feasibility (+) |ru'esai, naisaicu'i
What is Lojban? is now available for purchase! The lojban.org site is now available, at least partially, in a


(1, 1, -1) |possibility (+)/eventuality (+)/doubt (-) |ru'e, naicainai
variety of different languages.  The vast majority of the site has


(1, 0, 1) | |cu'isaicu'i
been marked up in a way to make easy translation possible, but not


(1, 0, 0) |likelihood (+)/probability (+)/adversative (-)/favourable(+)? |sai
all of the actual translation has been done.  If you want to help,


(1, 0, -1) |true, irrefutable, reliable (+) |cu'icu'i, nainai, [[jbocre: ja'ai|ja'ai]]
please contact the webmaster.  Also, there is now a web-based IRC


(1, -1, 1) |falsifiable/determinant |cu'inairu'e, cu'icainai
client available on the Forums page.  The French and Spanish Lojban


(1, -1, 0) |evidence (+)/no controversy? |naicu'inai
lists are now available. A Lojbanic translation program has been


(1, -1, -1) |certainty (+) |cai, nairu'enai
installed.


(0, 1, 1) |plausibility (-)/feasibility (-) |saicu'i, nairu'esai, cainaisai
{ANAME()}11May2003{ANAME}


(0, 1, 0) |contingency/symmetric doubt |cu'isai
== 11 May 2003 ==


(0, 1, -1) |no evidence (-)/controversy (-) |cu'i
Some bylaw changes from 1992 were incorporated.  Split off


(0, 0, 1) |likelihood (-)/adversative |naisai, ru'ecu'inai
of Old Projects into a seperate page, many changes (mostly minor) to


(0, 0, 0) |(abdiction/abduction/abdication(?] unimportant/aoristic/apathy|sairu'ecu'i, caicu'isai, ru'ecu'isai
the projects and committees pages. Markup changes all over the


(0, 0, -1) |unlikelihood? (-)/granted that/unfavourable (-) |ru'ecu'i, naisainai
place.


(0, -1, 1) |evidence (-) |cu'inai
The full changes list can be found at [http://www.lojban.org/cgi-bin/aegis.cgi?file@chan_menu+project@lojban-web+change@144 the


(0, -1, 0) |incontingent |cu'isainai
Aegis change page for change number 144].


(0, -1, -1) |unfeasibility (-) |caicu'i
{ANAME()}11May2003{ANAME}


(-1, 1, 1) |doubt (+)/uncertainty/possibility (-)/eventuality (-) |nairu'e, cainai
== 7 April 2003 ==


(-1, 1, 0) |no evidence (+)/controversy (+)/extortion (-) |naicu'i
This is the first site update in a long time, and as such it's a big


(-1, 1, -1) |unfalsifiable/total contingency/certainly contingent |cu'icai
one.  The site now has [http://www.bestpractical.com/rt/ equest Tracker] set up,


(-1, 0, 1) |false, negation, reliable (-) |nai
and that is being used to manage necessary changes.  The Level 0


(-1, 0, 0) |unlikelihood? (+)/improbability/unfavourable (+) |sainai, nairu'ecu'i, cainaicu'i
book was added to the main site, a Helping Lojban page, a Help page,


(-1, 0, -1) | |cu'icaicu'i
and a Feedback page were all added, and jbovlaste and Request


(-1, -1, 1) |impossibility, certainty (-), not eventual |ru'enai, naicai
Tracker were both linked in.


(-1, -1, 0) |unfeasibility (+) |naicaicu'i, ru'enaicu'i, ru'esainai
{ANAME()}30Dec2002{ANAME}


(-1, -1, -1) |contradiction, paradox |sairu'enai, sainaicai, caicu'icai, ru'ecu'icai||
== 30 December 2002 ==


----
An IRC logging system has been set up.  See [http://www.lojban.org/resources/forums.html he Lojbanic Forums page].  Also, many


[[User:And Rosta|And Rosta]] am not sure what '0'/'ina' is. Is it "either true/1 or false/-1 -- but I don't know which", i.e. a kind of epistemic modality as suggested by the glosses for the operators and by the gloss 'maybe'? Or is it "neither true nor false (but rather, in between)", as in fuzzy logic, in which case, 'sort of' might be a better gloss? I don't deny that when reasoning, we may want to treat 'maybe' and 'sort of' alike, but in understanding the trivalent system, and in thinking about how to implement it in Lojban, we need to get a clearer handle on the nature of '0'/'ina'.
pages have been edited to point to wiki.lojban.org as the official wiki


----
site, which will continue to be the right place even if someone else


''"Trivalent Logic" in Lojban''
takes it over.


.i le logji cu logji lo se vamji be ci da i logji lo cibdzaselva'i i ta'unai le logji cu cibdzaselva'i logji
{ANAME()}28Nov2002{ANAME}


----
== 28 November 2002 ==


''All very fascinating! Do you suppose the Aymara language was created artificially? (''At least one really weird person -- I think the author of the text this all is based on -- believes that Aymara was created by the culture god = space man. pc'')Have you ever heard it spoken, Jorge? ''(Nope, but I found the article fascinating too --mi'e [[User:xorxes|xorxes]])''I see they understand the difference between nibli, mukti, and rinka! But I still don't get your logic system. I need to study it more. Why aren't you using cai, cu'i, and nai? The 3rd value is "maybe". Why do we need a new word "ina"? --xod''
The new [http://www.lojban.org/llg/baseline.html fficial Baseline Statement],


I used the word ''ina'' just in order to use the source culture's word; in English ''maybe'' will work and in Lojban ''norje'u''. The system still needs work, but it promises to be a rich and interesting logic which allows reasoning about much more complex things than the standard logic. Sorry for the confusion, it was me who put up the above table. -- Adam
from the LLG has been posted.


''But cu'i is the neutral term, which my reading of the Aymara link indicates is the meaning of the "third term of logic". --xod''
{ANAME()}14Nov2002{ANAME}


''cu'i'' was used in the above system to represent a unary operator, not a truth-value, though it no doubt could have been done differently. Also, I was looking for a word to parallel ''jetnu'' and ''jitfa''. -- Adam
== 14 November 2002 ==


In some contexts in might be ''[[jbocre: na'i|na'i]]'' in Lojban. In ''[http://www.aoe.vt.edu/~ciochett/lit/zen.html en and the Art of Motorcycle Maintenance]'' it is called ''mu'' (from Japanese).
Addition to the [http://www.lojban.org/llg/projects.html fficial Projects Page],


* What would count as a valid argument in trivalent logic? I assume that in trivalent logic, in addition to valid and invalid arguments, there would be maybe-valid arguments. -- Adam
minor fixes and updates.
** Valid arguments, invalid arguments, and non-arguments ;)


Just a couple of add-ons:
{ANAME()}24Oct2002{ANAME}


# There are two kinds (at least) of valid: always-true and never-false and I suppose you could add combo (no false premises gives true or unfalse.  Rules or trees would generate different of these sets and give different parallel conditionals.  I haven't seen good rules sets for any of them.
== 24 October 2002 ==


# A complete set of trivalent unary connectives can be generated from three: one rotation (e.g., <-1,1,0>), one exchange (e.g., <-1,0,1>) and one identification (e.g. <1,1,-1>).  Different choices make for differently efficient definitions.  This rule applies in fact for any finite number of truth-values (in two, the rotation and the swap are the same: negation).  All connectives of any variety can be defined in terms of either the [http://en.wikipedia.org/wiki/Peirce_arrow eirce] or [http://en.wikipedia.org/wiki/Sheffer_stroke cheffer] functions: NOR or NAND, Max+1 or Min-1 (I think--I regularly screw this one up)
A [http://www.lojban.org/resources/promotional.html romotional Materials] page


** This suggests that any three moves of the sort listed will doThat is true for three values but not generally.  In particular, a rotation whose span (the distance a place moves in one application) shares a prime factor with the number of values will not serve as the rotation needed. In three-valued logic the rotation can be replaced by another exchange. This does not happen generally, nor can the problem rotations be cured by any exchange generally. To be on the safe side, I say that in any variety the 1-2 exchange, the 1-left rotation and the 1->2 identification are sufficient.  The number cannot be reduced -- within one-place connectives -- nor can either the rotation or the exchange be eliminated.  Other combinations of an exchange and a rotation may work however.
has been createdAlso, I've made a [http://www.lojban.org//cgi-bin/twiki/view/Files/ Community Files


pc >|8}
Area], which is a TWiki (a web-based colloborative space).


*** For each n, the role of a single rotation + a single exchange can be played by n-1 exchanges, provided that they are connected -- there is a path from any one value to any other using the exchanges provided.  The 3-value case (replace the rotation by an exchange) works because every pair of exchanges over three values is connected.  The two value case - using only negation -- fits better with this generalization than with the universal 3-function scheme.  Any rotation that does not share a prime factor with n can be used as the rotation (a rotation with a span of 1 can be defined).  In any case, only one identification is needed.  >|8}
{ANAME()}21Oct2002{ANAME}


----
== 21 October 2002 ==


For a given unary operator, its ''opposite'' is the result of applying ''nai'' to it, or of multiplying it by -1. For example, the opposite of ''ru'e'' (1, 1, -1) is ''ru'enai'' (-1, -1, 1). Also, its ''antonym'' is the result of applying it to ''nai'', or of reversing its order. For example, the antonym of ''ru'e'' (1, 1, -1) is ''nairu'e'' (-1, 1, 1).
The [http://www.lojban.org/resources/faq.html ojban FAQ] has been updated and


Unary operators are commutative (''[[jbocre: cairu'e|cairu'e]]sai'' = ''cai[[jbocre: ru'esai|ru'esai]]'') and so the opposite of the antonym is the same as the antonym of the opposite (''[[jbocre: nairu'e|nairu'e]]nai'' = ''nai[[jbocre: ru'enai|ru'enai]]''), and the opposite-antonym of the opposite-antonym is the operator itself (''nai[[jbocre: nairu'enai|nairu'enai]]nai'' = ''[[jbocre: nainai|nainai]]ru'e[[jbocre: nainai|nainai]]'' = ''ru'e''). ''ru'e'' and ''cai'' are opposite antonyms.
moved and revamped and such.  .uisai  Thanks go to [http://www.lojban.org/mailto:daltonG@digitalkingdom.org alton Graham] for doing


It is possible to move ''nai'' around, but every operator that it crosses must be replaced by its opposite-antonym. ''cainai'' -> ''nairu'enai nai'' -> ''nairu'e'', etc.
most of the work.


This works very similarly to the traditional logical operators of possibility and necessity, i.e. ''it is possible that not ...'' = ''it is not necessary that ...'', etc. However, there are differences. ''It is possible that broda and it is possible that not broda'' in two-valued modal logic says nothing about the actual truth value of ''broda''. However, (taking AND(x, y) to be min(x, y] the truth-value of ''ge ru'e broda gi nairu'e broda'' is equivalent to the truth-value of ''cu'icai broda'', and the statement claims that the truth-value of ''broda'' must necessarily be ''norje'u'':
{ANAME()}23Sep2002{ANAME}


|| broda | ge |ru'e |broda gi nairu'e broda
== 23 September 2002 ==


1  | -1 | 1  |          -1
There has been a major revamp of the Resources section. It has a lot


0  |  1 |  1  |          1
more information in it now.


-1  | -1 | -1  |          1||
{ANAME()}18Sep2002{ANAME}


----
== 18 September 2002 ==


The opposite and the antonym can be defined with ''any'' unary operator that nullifies itself when applied to itself, i.e. ''ja'ai'', ''nai'', ''cu'i'', and ''naicu'inai''. For example, the ''cu'i''-opposite antonym of ''ru'esai'' (1, 1, 0) is ''cu'iru'esaicu'i'' = ''naisai'' (0, 0, 1), and so ''ru'esai cu'i'' = ''cu'i naisai''.
The old minutes of the LLG have been posted, thanks to [http://www.miranda.org/~jkominek/ ay Kominek]. He also html


It is relatively intuitive to understand what the ''nai''-opposite antonym means ("''it is not possible/probable/certain, etc. that not''"), but it is less obvious what the ''cu'i''-opposite antonym means. (Or for that matter what the ''cu'i''-opposite or ''cu'i''-antonym means) at least for me. Any suggestions?
formatted the bylaws.  See [http://www.lojban.org/publications.html the LLG


----
publications page].


There are 3**9 = 19,683 possible binary operators. A simple and relatively intuitive definition for AND is the minimum of the two predicates and for OR is the maximum of the two predicates:
The [http://www.lojban.org/llg/projects.html fficial LLG Projects] page has been


|| '''x''' |  '''y''' |'''x AND y'''
constructed. Please submit anything you are working on!


1 |  1 |  1
An [http://www.lojban.org/llg/committees.html fficial LLG Committees] page has


1 |  0 |  0
also been added.


1 | -1 |  -1
An interactive


0 |  1 |  0
story has been added; see [http://www.lojban.org/texts/original.html the original


0 |  0 |  0
lojbanic texts page].


0 | -1 |  -1
{ANAME()}9Aug2002{ANAME}


-1 |  1 |  -1
== 9 August 2002 ==


-1 |  0 |  -1
As may be obvious, I just made some drastic changes to the layout of


-1 | -1 | -1||
the site. Please let me


||  '''x''' | '''y''' |'''x OR y'''
([http://www.lojban.org/mailto:w webmaster@lojban.org])


1 |  1 |  1
know what you think!


1 |  0 |  1
{ANAME()}23Jul2002{ANAME}


1 | -1 |  1
== 23 July 2002 ==


0 |  1 |  1
LogFest, the annual gathering of lojbanists, is this coming weekend.


0 |  0 |  0
Also, the 2002 Annual Meeting of the Members of the LLG will be held


0 | -1 |  0
on Sunday, July 28th (during LogFest).


-1 |  1 |  1
The 2002 Annual Meeting of the Members of the LLG will be held at


-1 |  0 |  0
1030AM EDT on Sunday July 28, 2002 at lojbab's house, 2904 Beau


-1 | -1 | -1||
Lane, Fairfax VA 22031 USA.  There being insufficient notice as


-- [[jbocre: Adam|Adam]]
required, no bylaw changes can be considered.


**The author of the article that started all this for us has a complicated device for generating some fraction of two-placed connectives from the one-placed and something like addition and multiplication.  He seems to think that this formula is actually used in Aymara, but offers only a small number of cases, of the sort that are likely fixed expressions.  The formula seems too complicated to be used creatively.
LogFest mostly consists of a bunch of people hanging out at lojbab's


----
house, talking in and about lojban.  The annual meeting always


This is all well and good if you want to ''represent'' degrees of trueness in language, but can you use it to prove things about propositions with values over the three-valued set?  Like do you have the equivalent of many versions of ''modens ponen'': In ordinary logic ''modus ponens'' says A -> B and you have A true, then B is true. And you also get the contrapositive, ''modus tollens'': if you have not B, you have not A.  But if A is probably true, is B possibly true?  If B is possibly not true, is A probably not true? If A implies only probably B, does having A mean you have possibly B? (you need the truth/falsity operators in unary forms that you can attach to letters) And does not having B mean you possibly don't have A?
occurs during LogFest.


With just this rule and the rule that you can accept any tautology as true, you can prove all the theorems in ordinary propositional calculus (it's complete--- too simple for Godel's theorrem to apply (in fact he proved the "Completeness theorem" for propositional calculus), for that you need some numbers or sets, like if you make the propositions things like a is an element of the set B then you run into incompleteness (and I may add theorems that are actually worth proving!].  But Anyway with the ''modus ponens/tollens'' I proposed, can we prove all the theorems of this logic?  Or is it, as I fear, inconsistent somewhere?  Or incomplete? Or both?  (It might be incomplete because two propositions that might have a difference in truth value between one of our three values and then you'd have to start reasoning about possibly probably and so on as someone did above with the 27 beautiful words that unfortunately sound like trig functions to me...
{ANAME()}1Jul2002{ANAME}


-Millie
== 1 July 2002 ==


*Well, just the rule "Accept any tautology" will give a complete system, since "complete" means "the set of theorems = the set of tautologies."  But taking some set of tautologies as given, MPP or MTT will be crucial rules in developing a complete system.  In the case of three-valued logic, there at least two notions of "tautology": "always true" and "never false."  There are also at least three notions of negation and God knows how many notions of conditional, in most of which MTT and MPP will hold (that being a part of the intuitive notion of conditionals).  For a variety of such three-valued systems, Rescher (Many-Valued Logics), for example, gives complete sets of rules and axioms and also notes some cases that do not appear to be completable (and at least one case that has no theorems because no tautologoes).
There was a major (several day) downtime of this site, due to bad


Getting numbers in does not guarantee  incompleteness, since Tarski analysis is complete, while Peano arithmentic is notAnd you can get incompleteness without numbers (though Goedel's proof will not be directly useful) in the strong sense that no finite extension is complete (just ''this'' is not complete is a snap - leave out a rule or an axiom). Many of these systems may be incomplete in the sense that not all possible three-valued claims can be expressed in them, but at least some are complete in this sense also. pc
RAM, which in turn caused file system corruptionThe problem has


----
been solved, and this machine now has a new, larger hard drive, as


On creating three-value logic truth tables. For combining "true" &amp; "maybe"
well as a completely new operating system (NetBSD 1.5.2).


(or "fictive"): a novel about Teddy Roosevelt as a detective is not more
In addition, since the last update this machine has gotten a much


"true" for having a real person as a character. But an appearance of Sherlock
faster processor and been moved into a co-location facility with a


Holmes in a biography of Teddy Roosevelt seriously discredits the veracity of
connection to the internet that is close to 300Mb/s.


the author... (''mi'e maikl'')
{ANAME()}2May2002{ANAME}


**This is on a different point: what to do with non-existent objectsHere the point is that TR has a fictive counterpart (perhaps having all the properties of the real TR that are compatible with the story), whereas SH is not the counterpart (stories about Prof. Bell notwithstanding) of any real person and so has exactly the properties ascribed in the story/iesTypically (but this gets tricky with some rules) the subject sets the context, so that SH could do things to or for TR (the fictive counterpart), but TR could not do anything (non-intensional) to or for SH (SH was knighted by Victoria, but Victoria did not knight SH, for example). pc
== 2 May 2002 ==
 
Minor website updates have been madeIn particular, the contents
 
of the Learning Lojban sections have been slightly improved, and
 
many relative links have been fixed.
 
{ANAME()}18Apr2002{ANAME}
 
== 18 April 2002 ==
 
Amazing news!  The first draft of the Alice In Wonderland
 
translation appears to be completeThe only things missing are a
 
couple of the chapter titles and one stanza of a poem, as of this
 
writing.  Please go take a look in the Translations section!
 
== Old News ==
 
* [http://www.lojban.org/oldnews/26May2000.html 6 May 2000]

Revision as of 10:16, 15 January 2014

{ANAME()}21Aug2006{ANAME}

21 августа 2006

saxaras, первый ложбанско-русско-ложбанский электронный словарь, готов! Скачать его Вы сможете на его страничке: saxaras

{ANAME()}20Jul2006{ANAME}

20 июля 2006

Вы когда-нибудь были в стране,где говорят на Ложбане? Такая страна называется samxarmuj, что значит "компьютеризованная воображаемая вселенная". Это текстовый виртуальный мир, где вы можете управлять героем, отдавая команды на английском или на Ложбане. Ложбан в мире samxarmuj действует как язык магии: он позволяет творить объекты и наделять их формой и функциями.

И при этом вам даже не понадобится билет на самолет: [http://teddyb.org/cgi-bin/moo_ssh.html �ликните сюда] и введите гостевой пароль "moo" (пока вы не заведете свой эккаунт). Команды печатаются в нижней части окна. Гостевые эккаунты могут использовать только английский. Чтобы завести свой эккаунт, напечатайте команду "register". Регистрация совершенно бесплатна.

Дополнительная информация, включая другие способы доступа к samxarmuj, имеется на странице The Lojban MOO.

Напряженным трудом множества квалифицированных программистов нашего сообщества создана одна из самых привлекательных площадок, где можно пользоваться Ложбаном, за всю историю этого языка. Сегодня проект покидает бета-фазу испытательного периода. С трепетом душевным мы выпускаем в свет эту массовую многопользовательскую систему и объявляем ее открытой для всех. Но теперь нам нужно множество персонажей, чтобы заселить этот мир.

Мы бросаем клич новым магам любого уровня мастерства. Придите и начните обустраивать свой участок этой земли. Хотя для того, чтобы искать приключений в стране, которая появляется из небытия вокруг вас, не нужно знать Ложбан, все магические заклинания должны произноситься только на правильном Ложбане. Сила, внемлющая нашим речениям в samxarmuj и претворяющая их в плоть, не поймет никакого другого языка.

Новая страна приглашает и туристов, которые совсем не знакомы с Ложбаном. Не стесняйтесь задавать нам любые вопросы про то, как пользоваться системой. При достаточном интересе, мы, кто знает, смогли бы даже учредить что-то вроде Хогвартской академии для начинающих ложбанских магов! Добро пожаловать в samxarmuj! Будьте как дома!

{ANAME()}4May2006{ANAME}

4 мая 2006

Праздник логического языка jbocre: jbonunsla 2006 состоялся на конвенте enguicon в Мичигане 21-23 апреля 2006. Следующий праздник будет на конвенте hilcon 2006 в ноябре!

{ANAME()}24Mar2006{ANAME}

24 марта 2006

jbocre: jbonunsla 2006, праздник логического языка, состоится на конвенте научной фантастике и выставке свободного программного обеспечения

enguicon в Мичигане, 21-23 апреля 2006. Это не исключает возможности других ложбанских фестивалей в 2006 году.

{ANAME()}4Jan2006{ANAME}

4 января 2006

Logfest (ежегодный сбор LLG) был проведен на конвенте PhilCon в Филадельфии с 9 по 11 декабря. Мероприятие оказалось вполне успешным, несмотря на то что участников приехало меньше, чем ожидалось. Подробности на странице jbocre: Logfest 2005.

{ANAME()}13Nov2005{ANAME}

13 ноября 2005

Как секретарь, приношу свои извинения за запоздалость этого объявления, но полное подтверждение

я получил всего лишь 10 дней назад.

hilcon - Филадельфийская конференция нучной фантастики и фэнтези согласилась предоставить зал для LogFest 2005!

Philcon 2005 проводится в гостинице Philadelphia Marriott Downtown

9 - 11 декабря 2005. Это ЧЕРЕЗ 26 ДНЕЙ!

Я понимаю, что это слишком короткое объявление, но если мы сможем собрать

достаточное количество людей, то зал нам предоставят и в следующем году, и

(хотелось бы) эти отношения будут продолжаться и дальше.

People showing up for LogFest will have to buy PhilCon

memberships. Please let me know if that, or any other aspect of

these arrangements, provides an unacceptable financial burden to

you. I, and others, are willing to help put up some money for

active Lojbanists who want to come.

We don't know how big the room is going to be yet, but I've told

them we expect about 10 people.

{ANAME()}5Sep2005{ANAME}

5 Sep 2005

Complete site overhaul! Most of the lojban.org content has been

moved from a set of static HTML pages to a

ikiWiki content management system. The

number of changes caused by this are too long to list. In addition,

the jbocre: LLG 2004 Annual Meeting Minutes have been posted.

{ANAME()}2May2004{ANAME}

2 May 2004

A variety of minor bug fixes were done on the site, as well as some

more major items. The front page was returned to CSS, XHTML and

Bobby Level 3 compliance. The problem with clicking on one of the

maps causing the maps to stop functioning was fixed. A couple of

one-sheet brochures were added to [http://www.lojban.org/publications/brochures.html the

brochures page]. The 25 November 2002 Board Meeting minutes were

added. The 2003 annual meeting minutes were added.

{ANAME()}10Sep2003{ANAME}

10 September 2003

What is Lojban? is now available for purchase! The lojban.org site is now available, at least partially, in a

variety of different languages. The vast majority of the site has

been marked up in a way to make easy translation possible, but not

all of the actual translation has been done. If you want to help,

please contact the webmaster. Also, there is now a web-based IRC

client available on the Forums page. The French and Spanish Lojban

lists are now available. A Lojbanic translation program has been

installed.

{ANAME()}11May2003{ANAME}

11 May 2003

Some bylaw changes from 1992 were incorporated. Split off

of Old Projects into a seperate page, many changes (mostly minor) to

the projects and committees pages. Markup changes all over the

place.

The full changes list can be found at [http://www.lojban.org/cgi-bin/aegis.cgi?file@chan_menu+project@lojban-web+change@144 the

Aegis change page for change number 144].

{ANAME()}11May2003{ANAME}

7 April 2003

This is the first site update in a long time, and as such it's a big

one. The site now has equest Tracker set up,

and that is being used to manage necessary changes. The Level 0

book was added to the main site, a Helping Lojban page, a Help page,

and a Feedback page were all added, and jbovlaste and Request

Tracker were both linked in.

{ANAME()}30Dec2002{ANAME}

30 December 2002

An IRC logging system has been set up. See he Lojbanic Forums page. Also, many

pages have been edited to point to wiki.lojban.org as the official wiki

site, which will continue to be the right place even if someone else

takes it over.

{ANAME()}28Nov2002{ANAME}

28 November 2002

The new fficial Baseline Statement,

from the LLG has been posted.

{ANAME()}14Nov2002{ANAME}

14 November 2002

Addition to the fficial Projects Page,

minor fixes and updates.

{ANAME()}24Oct2002{ANAME}

24 October 2002

A romotional Materials page

has been created. Also, I've made a [http://www.lojban.org//cgi-bin/twiki/view/Files/ Community Files

Area], which is a TWiki (a web-based colloborative space).

{ANAME()}21Oct2002{ANAME}

21 October 2002

The ojban FAQ has been updated and

moved and revamped and such. .uisai Thanks go to alton Graham for doing

most of the work.

{ANAME()}23Sep2002{ANAME}

23 September 2002

There has been a major revamp of the Resources section. It has a lot

more information in it now.

{ANAME()}18Sep2002{ANAME}

18 September 2002

The old minutes of the LLG have been posted, thanks to ay Kominek. He also html

formatted the bylaws. See [http://www.lojban.org/publications.html the LLG

publications page].

The fficial LLG Projects page has been

constructed. Please submit anything you are working on!

An fficial LLG Committees page has

also been added.

An interactive

story has been added; see [http://www.lojban.org/texts/original.html the original

lojbanic texts page].

{ANAME()}9Aug2002{ANAME}

9 August 2002

As may be obvious, I just made some drastic changes to the layout of

the site. Please let me

(webmaster@lojban.org)

know what you think!

{ANAME()}23Jul2002{ANAME}

23 July 2002

LogFest, the annual gathering of lojbanists, is this coming weekend.

Also, the 2002 Annual Meeting of the Members of the LLG will be held

on Sunday, July 28th (during LogFest).

The 2002 Annual Meeting of the Members of the LLG will be held at

1030AM EDT on Sunday July 28, 2002 at lojbab's house, 2904 Beau

Lane, Fairfax VA 22031 USA. There being insufficient notice as

required, no bylaw changes can be considered.

LogFest mostly consists of a bunch of people hanging out at lojbab's

house, talking in and about lojban. The annual meeting always

occurs during LogFest.

{ANAME()}1Jul2002{ANAME}

1 July 2002

There was a major (several day) downtime of this site, due to bad

RAM, which in turn caused file system corruption. The problem has

been solved, and this machine now has a new, larger hard drive, as

well as a completely new operating system (NetBSD 1.5.2).

In addition, since the last update this machine has gotten a much

faster processor and been moved into a co-location facility with a

connection to the internet that is close to 300Mb/s.

{ANAME()}2May2002{ANAME}

2 May 2002

Minor website updates have been made. In particular, the contents

of the Learning Lojban sections have been slightly improved, and

many relative links have been fixed.

{ANAME()}18Apr2002{ANAME}

18 April 2002

Amazing news! The first draft of the Alice In Wonderland

translation appears to be complete. The only things missing are a

couple of the chapter titles and one stanza of a poem, as of this

writing. Please go take a look in the Translations section!

Old News