Show simple item record

Forcing under Anti-Foundation Axiom: An expression of the stalks

dc.contributor.authorKentaro, Satoen_US
dc.date.accessioned2007-07-11T18:17:07Z
dc.date.available2007-07-11T18:17:07Z
dc.date.issued2006-06en_US
dc.identifier.citationKentaro, Sato (2006). "Forcing under Anti-Foundation Axiom: An expression of the stalks." Mathematical Logic Quarterly 52(3): 295-314. <http://hdl.handle.net/2027.42/55242>en_US
dc.identifier.issn0942-5616en_US
dc.identifier.issn1521-3870en_US
dc.identifier.urihttps://hdl.handle.net/2027.42/55242
dc.description.abstractWe introduce a new simple way of defining the forcing method that works well in the usual setting under FA, the Foundation Axiom, and moreover works even under Aczel's AFA, the Anti-Foundation Axiom. This new way allows us to have an intuition about what happens in defining the forcing relation. The main tool is H. Friedman's method of defining the extensional membership relation ∈ by means of the intensional membership relation. Analogously to the usual forcing and the usual generic extension for FA-models, we can justify the existence of generic filters and can obtain the Forcing Theorem and the Minimal Model Theorem with some modifications. These results are on the line of works to investigate whether model theory for AFA-set theory can be developed in a similar way to that for FA-set theory. Aczel pointed out that the quotient of transition systems by the largest bisimulation and transition relations have the essentially same theory as the set theory with AFA. Therefore, we could hope that, by using our new method, some open problems about transition systems turn out to be consistent or independent. (© 2006 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)en_US
dc.format.extent258785 bytes
dc.format.extent3118 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypetext/plain
dc.publisherWILEY-VCH Verlagen_US
dc.subject.otherMathematics and Statisticsen_US
dc.titleForcing under Anti-Foundation Axiom: An expression of the stalksen_US
dc.typeArticleen_US
dc.rights.robotsIndexNoFollowen_US
dc.subject.hlbsecondlevelMathematicsen_US
dc.subject.hlbtoplevelScienceen_US
dc.description.peerreviewedPeer Revieweden_US
dc.contributor.affiliationumResearch Center for Verification and Semantics (CVS), National Institute of Advanced Industrial Science and Technology (AIST), Japan ; Department of Mathematics, University of Michigan, Ann Arbor, Michigan, 48109-1043, USA ; Graduate School of Science and Technology, Kobe University, Rokkodai-cho, Nada-ku, Kobe, 657-8501, Japanen_US
dc.description.bitstreamurlhttp://deepblue.lib.umich.edu/bitstream/2027.42/55242/1/295_ftp.pdfen_US
dc.identifier.doihttp://dx.doi.org/10.1002/malq.200410060en_US
dc.identifier.sourceMathematical Logic Quarterlyen_US
dc.owningcollnameInterdisciplinary and Peer-Reviewed


Files in this item

Show simple item record

Remediation of Harmful Language

The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.

Accessibility

If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.